{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ORJL3OSA6W6BGZD5PYP6UYPP3O","short_pith_number":"pith:ORJL3OSA","schema_version":"1.0","canonical_sha256":"7452bdba40f5bc13647d7e1fea61efdbb2b6958eb795080b73f8b4ad13b0cbd3","source":{"kind":"arxiv","id":"2605.15983","version":1},"attestation_state":"computed","paper":{"title":"Petri Net Induced Heuristic Search for Resource Constrained Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dor Atzmon, Ido Lublin, Izack Cohen","submitted_at":"2026-05-15T14:15:50Z","abstract_excerpt":"We formulate the Resource-Constrained Project Scheduling Problem (RCPSP) as optimal search over the reachability graph of a Timed Transition Petri Net with Resources, using relative-delay tokens so that scheduling decisions correspond to transition firings in the induced state space. We solve the resulting problem with $A^*$ guided by a heuristic that combines Critical Path and resource-based lower bounds, and prove that it is consistent under our token-based time semantics. Experiments on the PSPLIB benchmarks show that the approach outperforms strong exact Mixed-Integer Linear Programming (M"},"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":"2605.15983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-15T14:15:50Z","cross_cats_sorted":[],"title_canon_sha256":"854f55de325c084358aa767431762c8598b18048cc89aa2f8220e965854297ba","abstract_canon_sha256":"2ff190c705dce58ca8a13160b5eef35aa62884adaab7640406073f41a4290e47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:47.676370Z","signature_b64":"d7BXBb4Df+1c9MIMWzOr38I2q/Jcv2PwiklR/fNC2FsKImDuFwoqDXM6kI9fVd2Rvae+z+831fMsdaWJMpdEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7452bdba40f5bc13647d7e1fea61efdbb2b6958eb795080b73f8b4ad13b0cbd3","last_reissued_at":"2026-05-20T00:01:47.675356Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:47.675356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Petri Net Induced Heuristic Search for Resource Constrained Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dor Atzmon, Ido Lublin, Izack Cohen","submitted_at":"2026-05-15T14:15:50Z","abstract_excerpt":"We formulate the Resource-Constrained Project Scheduling Problem (RCPSP) as optimal search over the reachability graph of a Timed Transition Petri Net with Resources, using relative-delay tokens so that scheduling decisions correspond to transition firings in the induced state space. We solve the resulting problem with $A^*$ guided by a heuristic that combines Critical Path and resource-based lower bounds, and prove that it is consistent under our token-based time semantics. Experiments on the PSPLIB benchmarks show that the approach outperforms strong exact Mixed-Integer Linear Programming (M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.15983","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/2605.15983/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:44.054590Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:01:55.676498Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"6295e74691359ad5db56dd69b6554b71584947cbc3c177d9e0f98fcd267c4606"},"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":"2605.15983","created_at":"2026-05-20T00:01:47.675864+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15983v1","created_at":"2026-05-20T00:01:47.675864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15983","created_at":"2026-05-20T00:01:47.675864+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORJL3OSA6W6B","created_at":"2026-05-20T00:01:47.675864+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORJL3OSA6W6BGZD5","created_at":"2026-05-20T00:01:47.675864+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORJL3OSA","created_at":"2026-05-20T00:01:47.675864+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/ORJL3OSA6W6BGZD5PYP6UYPP3O","json":"https://pith.science/pith/ORJL3OSA6W6BGZD5PYP6UYPP3O.json","graph_json":"https://pith.science/api/pith-number/ORJL3OSA6W6BGZD5PYP6UYPP3O/graph.json","events_json":"https://pith.science/api/pith-number/ORJL3OSA6W6BGZD5PYP6UYPP3O/events.json","paper":"https://pith.science/paper/ORJL3OSA"},"agent_actions":{"view_html":"https://pith.science/pith/ORJL3OSA6W6BGZD5PYP6UYPP3O","download_json":"https://pith.science/pith/ORJL3OSA6W6BGZD5PYP6UYPP3O.json","view_paper":"https://pith.science/paper/ORJL3OSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15983&json=true","fetch_graph":"https://pith.science/api/pith-number/ORJL3OSA6W6BGZD5PYP6UYPP3O/graph.json","fetch_events":"https://pith.science/api/pith-number/ORJL3OSA6W6BGZD5PYP6UYPP3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORJL3OSA6W6BGZD5PYP6UYPP3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORJL3OSA6W6BGZD5PYP6UYPP3O/action/storage_attestation","attest_author":"https://pith.science/pith/ORJL3OSA6W6BGZD5PYP6UYPP3O/action/author_attestation","sign_citation":"https://pith.science/pith/ORJL3OSA6W6BGZD5PYP6UYPP3O/action/citation_signature","submit_replication":"https://pith.science/pith/ORJL3OSA6W6BGZD5PYP6UYPP3O/action/replication_record"}},"created_at":"2026-05-20T00:01:47.675864+00:00","updated_at":"2026-05-20T00:01:47.675864+00:00"}