{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:P5ZXK5TLOR6PTELQCSRESF5WWW","short_pith_number":"pith:P5ZXK5TL","schema_version":"1.0","canonical_sha256":"7f7375766b747cf9917014a24917b6b599933bc834d3e24e4748fabad4f9c0fb","source":{"kind":"arxiv","id":"2108.01068","version":1},"attestation_state":"computed","paper":{"title":"Time-based Dynamic Controllability of Disjunctive Temporal Networks with Uncertainty: A Tree Search Approach with Graph Neural Network Guidance","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.RO"],"primary_cat":"cs.AI","authors_text":"Andrei Bursuc, Christophe Guettier, Eric Jacopin, J. Benton, Jeremy Frank, Kevin Osanlou, Tristan Cazenave","submitted_at":"2021-08-02T17:54:25Z","abstract_excerpt":"Scheduling in the presence of uncertainty is an area of interest in artificial intelligence due to the large number of applications. We study the problem of dynamic controllability (DC) of disjunctive temporal networks with uncertainty (DTNU), which seeks a strategy to satisfy all constraints in response to uncontrollable action durations. We introduce a more restricted, stronger form of controllability than DC for DTNUs, time-based dynamic controllability (TDC), and present a tree search approach to determine whether or not a DTNU is TDC. Moreover, we leverage the learning capability of a mes"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2108.01068","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2021-08-02T17:54:25Z","cross_cats_sorted":["cs.LG","cs.RO"],"title_canon_sha256":"1ea43e6a52bbfea91c6d4e408da8a76a6efa2782348256a6db73db7c1bcc7249","abstract_canon_sha256":"00bbe4fba2c03c8a089509826d36b1899290cf862f0f90efa7c3021270d0b02e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:02:35.402005Z","signature_b64":"phoEDJZ3NmZLjFTRPebczhGXjdGRReRDDehNnGh5nTeO7R7qmqYUEGIQMAm35oF9FMUeltGp8tqa/TpU8x/EDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f7375766b747cf9917014a24917b6b599933bc834d3e24e4748fabad4f9c0fb","last_reissued_at":"2026-07-05T03:02:35.401631Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:02:35.401631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-based Dynamic Controllability of Disjunctive Temporal Networks with Uncertainty: A Tree Search Approach with Graph Neural Network Guidance","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.RO"],"primary_cat":"cs.AI","authors_text":"Andrei Bursuc, Christophe Guettier, Eric Jacopin, J. Benton, Jeremy Frank, Kevin Osanlou, Tristan Cazenave","submitted_at":"2021-08-02T17:54:25Z","abstract_excerpt":"Scheduling in the presence of uncertainty is an area of interest in artificial intelligence due to the large number of applications. We study the problem of dynamic controllability (DC) of disjunctive temporal networks with uncertainty (DTNU), which seeks a strategy to satisfy all constraints in response to uncontrollable action durations. We introduce a more restricted, stronger form of controllability than DC for DTNUs, time-based dynamic controllability (TDC), and present a tree search approach to determine whether or not a DTNU is TDC. Moreover, we leverage the learning capability of a mes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.01068","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.01068/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2108.01068","created_at":"2026-07-05T03:02:35.401689+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.01068v1","created_at":"2026-07-05T03:02:35.401689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.01068","created_at":"2026-07-05T03:02:35.401689+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5ZXK5TLOR6P","created_at":"2026-07-05T03:02:35.401689+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5ZXK5TLOR6PTELQ","created_at":"2026-07-05T03:02:35.401689+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5ZXK5TL","created_at":"2026-07-05T03:02:35.401689+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P5ZXK5TLOR6PTELQCSRESF5WWW","json":"https://pith.science/pith/P5ZXK5TLOR6PTELQCSRESF5WWW.json","graph_json":"https://pith.science/api/pith-number/P5ZXK5TLOR6PTELQCSRESF5WWW/graph.json","events_json":"https://pith.science/api/pith-number/P5ZXK5TLOR6PTELQCSRESF5WWW/events.json","paper":"https://pith.science/paper/P5ZXK5TL"},"agent_actions":{"view_html":"https://pith.science/pith/P5ZXK5TLOR6PTELQCSRESF5WWW","download_json":"https://pith.science/pith/P5ZXK5TLOR6PTELQCSRESF5WWW.json","view_paper":"https://pith.science/paper/P5ZXK5TL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.01068&json=true","fetch_graph":"https://pith.science/api/pith-number/P5ZXK5TLOR6PTELQCSRESF5WWW/graph.json","fetch_events":"https://pith.science/api/pith-number/P5ZXK5TLOR6PTELQCSRESF5WWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5ZXK5TLOR6PTELQCSRESF5WWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5ZXK5TLOR6PTELQCSRESF5WWW/action/storage_attestation","attest_author":"https://pith.science/pith/P5ZXK5TLOR6PTELQCSRESF5WWW/action/author_attestation","sign_citation":"https://pith.science/pith/P5ZXK5TLOR6PTELQCSRESF5WWW/action/citation_signature","submit_replication":"https://pith.science/pith/P5ZXK5TLOR6PTELQCSRESF5WWW/action/replication_record"}},"created_at":"2026-07-05T03:02:35.401689+00:00","updated_at":"2026-07-05T03:02:35.401689+00:00"}