{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SV6367QIF5I3WXWDEFZDFCA4IA","short_pith_number":"pith:SV6367QI","schema_version":"1.0","canonical_sha256":"957dbf7e082f51bb5ec3217232881c4026c5b80fe2e022eaa72a4b31dd99c369","source":{"kind":"arxiv","id":"2406.06593","version":1},"attestation_state":"computed","paper":{"title":"Differentiable Combinatorial Scheduling at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.AR"],"primary_cat":"cs.LG","authors_text":"Cunxi Yu, Jiaqi Yin, Mingju Liu, Yingjie Li, Zhiru Zhang","submitted_at":"2024-06-06T02:09:39Z","abstract_excerpt":"This paper addresses the complex issue of resource-constrained scheduling, an NP-hard problem that spans critical areas including chip design and high-performance computing. Traditional scheduling methods often stumble over scalability and applicability challenges. We propose a novel approach using a differentiable combinatorial scheduling framework, utilizing Gumbel-Softmax differentiable sampling technique. This new technical allows for a fully differentiable formulation of linear programming (LP) based scheduling, extending its application to a broader range of LP formulations. To encode in"},"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":"2406.06593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-06T02:09:39Z","cross_cats_sorted":["cs.AI","cs.AR"],"title_canon_sha256":"55a79bbc47c2fb61e423e5a7803d23758682f397f0f09b6ad62233008fcafe58","abstract_canon_sha256":"7e315ec660f38ed13e9283b813ed09a3066e860de895a5bb2567a6854fb03fc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:47.836483Z","signature_b64":"mpJ6bbRZSRJUvbjKKiCn73O/0kKOHwKv/Oq56Hf1ruU2QswP0RUvlFifm3QuekBUf8ZCRcBAH0e1VPFgv7UGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"957dbf7e082f51bb5ec3217232881c4026c5b80fe2e022eaa72a4b31dd99c369","last_reissued_at":"2026-07-05T08:29:47.836057Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:47.836057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentiable Combinatorial Scheduling at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.AR"],"primary_cat":"cs.LG","authors_text":"Cunxi Yu, Jiaqi Yin, Mingju Liu, Yingjie Li, Zhiru Zhang","submitted_at":"2024-06-06T02:09:39Z","abstract_excerpt":"This paper addresses the complex issue of resource-constrained scheduling, an NP-hard problem that spans critical areas including chip design and high-performance computing. Traditional scheduling methods often stumble over scalability and applicability challenges. We propose a novel approach using a differentiable combinatorial scheduling framework, utilizing Gumbel-Softmax differentiable sampling technique. This new technical allows for a fully differentiable formulation of linear programming (LP) based scheduling, extending its application to a broader range of LP formulations. To encode in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.06593","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/2406.06593/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":"2406.06593","created_at":"2026-07-05T08:29:47.836113+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.06593v1","created_at":"2026-07-05T08:29:47.836113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.06593","created_at":"2026-07-05T08:29:47.836113+00:00"},{"alias_kind":"pith_short_12","alias_value":"SV6367QIF5I3","created_at":"2026-07-05T08:29:47.836113+00:00"},{"alias_kind":"pith_short_16","alias_value":"SV6367QIF5I3WXWD","created_at":"2026-07-05T08:29:47.836113+00:00"},{"alias_kind":"pith_short_8","alias_value":"SV6367QI","created_at":"2026-07-05T08:29:47.836113+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/SV6367QIF5I3WXWDEFZDFCA4IA","json":"https://pith.science/pith/SV6367QIF5I3WXWDEFZDFCA4IA.json","graph_json":"https://pith.science/api/pith-number/SV6367QIF5I3WXWDEFZDFCA4IA/graph.json","events_json":"https://pith.science/api/pith-number/SV6367QIF5I3WXWDEFZDFCA4IA/events.json","paper":"https://pith.science/paper/SV6367QI"},"agent_actions":{"view_html":"https://pith.science/pith/SV6367QIF5I3WXWDEFZDFCA4IA","download_json":"https://pith.science/pith/SV6367QIF5I3WXWDEFZDFCA4IA.json","view_paper":"https://pith.science/paper/SV6367QI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.06593&json=true","fetch_graph":"https://pith.science/api/pith-number/SV6367QIF5I3WXWDEFZDFCA4IA/graph.json","fetch_events":"https://pith.science/api/pith-number/SV6367QIF5I3WXWDEFZDFCA4IA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SV6367QIF5I3WXWDEFZDFCA4IA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SV6367QIF5I3WXWDEFZDFCA4IA/action/storage_attestation","attest_author":"https://pith.science/pith/SV6367QIF5I3WXWDEFZDFCA4IA/action/author_attestation","sign_citation":"https://pith.science/pith/SV6367QIF5I3WXWDEFZDFCA4IA/action/citation_signature","submit_replication":"https://pith.science/pith/SV6367QIF5I3WXWDEFZDFCA4IA/action/replication_record"}},"created_at":"2026-07-05T08:29:47.836113+00:00","updated_at":"2026-07-05T08:29:47.836113+00:00"}