{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VOTKGCX3KHXEZXCTHPUWPEACRH","short_pith_number":"pith:VOTKGCX3","schema_version":"1.0","canonical_sha256":"aba6a30afb51ee4cdc533be967900289e7cd886b149850139f7b4ed7bb53516b","source":{"kind":"arxiv","id":"2110.06365","version":1},"attestation_state":"computed","paper":{"title":"Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ferdinando Fioretto, James Kotary, Pascal Van Hentenryck","submitted_at":"2021-10-12T21:15:19Z","abstract_excerpt":"The Jobs shop Scheduling Problem (JSP) is a canonical combinatorial optimization problem that is routinely solved for a variety of industrial purposes. It models the optimal scheduling of multiple sequences of tasks, each under a fixed order of operations, in which individual tasks require exclusive access to a predetermined resource for a specified processing time. The problem is NP-hard and computationally challenging even for medium-sized instances. Motivated by the increased stochasticity in production chains, this paper explores a deep learning approach to deliver efficient and accurate a"},"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":"2110.06365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-12T21:15:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ac68b4c09f31feb51f276b8bde73ba46b6f47e3d494bd65df59eab159c36a714","abstract_canon_sha256":"2f721cdb40e22967d115d5bdb89822d48ee98beba7c7d93119a5e29d46680534"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:22:13.791176Z","signature_b64":"BkNDaJAFhb/YawBQtp7qyhIRrQe8DEC8PV/RDdDvamLo780IDwFzA0cUoMnFOy+5kXdbRvFsWEpTW0CxWUHzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aba6a30afb51ee4cdc533be967900289e7cd886b149850139f7b4ed7bb53516b","last_reissued_at":"2026-07-05T03:22:13.790798Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:22:13.790798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ferdinando Fioretto, James Kotary, Pascal Van Hentenryck","submitted_at":"2021-10-12T21:15:19Z","abstract_excerpt":"The Jobs shop Scheduling Problem (JSP) is a canonical combinatorial optimization problem that is routinely solved for a variety of industrial purposes. It models the optimal scheduling of multiple sequences of tasks, each under a fixed order of operations, in which individual tasks require exclusive access to a predetermined resource for a specified processing time. The problem is NP-hard and computationally challenging even for medium-sized instances. Motivated by the increased stochasticity in production chains, this paper explores a deep learning approach to deliver efficient and accurate a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.06365","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/2110.06365/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":"2110.06365","created_at":"2026-07-05T03:22:13.790850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.06365v1","created_at":"2026-07-05T03:22:13.790850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.06365","created_at":"2026-07-05T03:22:13.790850+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOTKGCX3KHXE","created_at":"2026-07-05T03:22:13.790850+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOTKGCX3KHXEZXCT","created_at":"2026-07-05T03:22:13.790850+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOTKGCX3","created_at":"2026-07-05T03:22:13.790850+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/VOTKGCX3KHXEZXCTHPUWPEACRH","json":"https://pith.science/pith/VOTKGCX3KHXEZXCTHPUWPEACRH.json","graph_json":"https://pith.science/api/pith-number/VOTKGCX3KHXEZXCTHPUWPEACRH/graph.json","events_json":"https://pith.science/api/pith-number/VOTKGCX3KHXEZXCTHPUWPEACRH/events.json","paper":"https://pith.science/paper/VOTKGCX3"},"agent_actions":{"view_html":"https://pith.science/pith/VOTKGCX3KHXEZXCTHPUWPEACRH","download_json":"https://pith.science/pith/VOTKGCX3KHXEZXCTHPUWPEACRH.json","view_paper":"https://pith.science/paper/VOTKGCX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.06365&json=true","fetch_graph":"https://pith.science/api/pith-number/VOTKGCX3KHXEZXCTHPUWPEACRH/graph.json","fetch_events":"https://pith.science/api/pith-number/VOTKGCX3KHXEZXCTHPUWPEACRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOTKGCX3KHXEZXCTHPUWPEACRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOTKGCX3KHXEZXCTHPUWPEACRH/action/storage_attestation","attest_author":"https://pith.science/pith/VOTKGCX3KHXEZXCTHPUWPEACRH/action/author_attestation","sign_citation":"https://pith.science/pith/VOTKGCX3KHXEZXCTHPUWPEACRH/action/citation_signature","submit_replication":"https://pith.science/pith/VOTKGCX3KHXEZXCTHPUWPEACRH/action/replication_record"}},"created_at":"2026-07-05T03:22:13.790850+00:00","updated_at":"2026-07-05T03:22:13.790850+00:00"}