{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6P26QNC6SXBDZD73D3CTSDRCY6","short_pith_number":"pith:6P26QNC6","schema_version":"1.0","canonical_sha256":"f3f5e8345e95c23c8ffb1ec5390e22c79b447696f5a7bf945b20b4f737158745","source":{"kind":"arxiv","id":"1703.00575","version":1},"attestation_state":"computed","paper":{"title":"On the NP-hardness of scheduling with time restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"An Zhang, Guangting Chen, Lin Chen, Yong Chen","submitted_at":"2017-03-02T01:19:26Z","abstract_excerpt":"In a recent paper, Braun, Chung and Graham [1] have addressed a single-processor scheduling problem with time restrictions. Given a fixed integer $B \\geq 2$, there is a set of jobs to be processed by a single processor subject to the following B-constraint. For any real $x$, no unit time interval $[x, x+1)$ is allowed to intersect more than $B$ jobs. The problem has been shown to be NP-hard when $B$ is part of the input and left as an open question whether it remains NP-hard or not if $B$ is fixed [1, 5, 7]. This paper contributes to answering this question that we prove the problem is NP-hard"},"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":"1703.00575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T01:19:26Z","cross_cats_sorted":[],"title_canon_sha256":"4aac48ab30e5b0f82d02688e613fe2b472f77b9479e1e654a6f5086d83b1cdc9","abstract_canon_sha256":"101af3cc8200d27364d1ae1dfb418225bc9746e81956a31b49b51ac9b6de8eb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:41.294405Z","signature_b64":"spBUelrEXX0bfJiw8ZbA+1mL93W818ZUoQX8RXgmhF+3nXRIQYSViBYVMaIl2M660WIKYhbgSY/Wc4OGM4IKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3f5e8345e95c23c8ffb1ec5390e22c79b447696f5a7bf945b20b4f737158745","last_reissued_at":"2026-05-18T00:49:41.293842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:41.293842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the NP-hardness of scheduling with time restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"An Zhang, Guangting Chen, Lin Chen, Yong Chen","submitted_at":"2017-03-02T01:19:26Z","abstract_excerpt":"In a recent paper, Braun, Chung and Graham [1] have addressed a single-processor scheduling problem with time restrictions. Given a fixed integer $B \\geq 2$, there is a set of jobs to be processed by a single processor subject to the following B-constraint. For any real $x$, no unit time interval $[x, x+1)$ is allowed to intersect more than $B$ jobs. The problem has been shown to be NP-hard when $B$ is part of the input and left as an open question whether it remains NP-hard or not if $B$ is fixed [1, 5, 7]. This paper contributes to answering this question that we prove the problem is NP-hard"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00575","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":""},"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":"1703.00575","created_at":"2026-05-18T00:49:41.293916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00575v1","created_at":"2026-05-18T00:49:41.293916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00575","created_at":"2026-05-18T00:49:41.293916+00:00"},{"alias_kind":"pith_short_12","alias_value":"6P26QNC6SXBD","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6P26QNC6SXBDZD73","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6P26QNC6","created_at":"2026-05-18T12:31:03.183658+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/6P26QNC6SXBDZD73D3CTSDRCY6","json":"https://pith.science/pith/6P26QNC6SXBDZD73D3CTSDRCY6.json","graph_json":"https://pith.science/api/pith-number/6P26QNC6SXBDZD73D3CTSDRCY6/graph.json","events_json":"https://pith.science/api/pith-number/6P26QNC6SXBDZD73D3CTSDRCY6/events.json","paper":"https://pith.science/paper/6P26QNC6"},"agent_actions":{"view_html":"https://pith.science/pith/6P26QNC6SXBDZD73D3CTSDRCY6","download_json":"https://pith.science/pith/6P26QNC6SXBDZD73D3CTSDRCY6.json","view_paper":"https://pith.science/paper/6P26QNC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00575&json=true","fetch_graph":"https://pith.science/api/pith-number/6P26QNC6SXBDZD73D3CTSDRCY6/graph.json","fetch_events":"https://pith.science/api/pith-number/6P26QNC6SXBDZD73D3CTSDRCY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6P26QNC6SXBDZD73D3CTSDRCY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6P26QNC6SXBDZD73D3CTSDRCY6/action/storage_attestation","attest_author":"https://pith.science/pith/6P26QNC6SXBDZD73D3CTSDRCY6/action/author_attestation","sign_citation":"https://pith.science/pith/6P26QNC6SXBDZD73D3CTSDRCY6/action/citation_signature","submit_replication":"https://pith.science/pith/6P26QNC6SXBDZD73D3CTSDRCY6/action/replication_record"}},"created_at":"2026-05-18T00:49:41.293916+00:00","updated_at":"2026-05-18T00:49:41.293916+00:00"}