{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RLAVA437YEHU2I7P6G6H52IQRM","short_pith_number":"pith:RLAVA437","schema_version":"1.0","canonical_sha256":"8ac150737fc10f4d23eff1bc7ee9108b2ceadca09996c03b6a3bc7408be9f87d","source":{"kind":"arxiv","id":"1410.7237","version":1},"attestation_state":"computed","paper":{"title":"A New Perspective on the Windows Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Salvatore Longo, Tobias Jacobs","submitted_at":"2014-10-27T13:49:35Z","abstract_excerpt":"The Windows Scheduling Problem, also known as the Pinwheel Problem, is to schedule periodic jobs subject to their processing frequency demands. Instances are given as a set of jobs that have to be processed infinitely often such that the time interval between two consecutive executions of the same job j is no longer than the job's given period $p_j$.\n  The key contribution of this work is a new interpretation of the problem variant with exact periods, where the time interval between consecutive executions must be strictly $p_j$. We show that this version is equivalent to a natural combinatoria"},"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":"1410.7237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-27T13:49:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"48c057eeb0e74f1237675131af5cebebf43b35c5f834f4f973563bc79a5cce55","abstract_canon_sha256":"5e59a800c8f432c3053c32aba2c1feac30ae55f215cb96937c40340c95d088f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:17.754647Z","signature_b64":"l+xqTVmg2pUbFCK80a1++FhyJDX9bVXNq0uQRNP2k9uFzCPMU6/zWARJlFW2clCom7f1oXpZa27wegE4C/QRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ac150737fc10f4d23eff1bc7ee9108b2ceadca09996c03b6a3bc7408be9f87d","last_reissued_at":"2026-05-18T02:39:17.754183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:17.754183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Perspective on the Windows Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Salvatore Longo, Tobias Jacobs","submitted_at":"2014-10-27T13:49:35Z","abstract_excerpt":"The Windows Scheduling Problem, also known as the Pinwheel Problem, is to schedule periodic jobs subject to their processing frequency demands. Instances are given as a set of jobs that have to be processed infinitely often such that the time interval between two consecutive executions of the same job j is no longer than the job's given period $p_j$.\n  The key contribution of this work is a new interpretation of the problem variant with exact periods, where the time interval between consecutive executions must be strictly $p_j$. We show that this version is equivalent to a natural combinatoria"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7237","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":"1410.7237","created_at":"2026-05-18T02:39:17.754246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7237v1","created_at":"2026-05-18T02:39:17.754246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7237","created_at":"2026-05-18T02:39:17.754246+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLAVA437YEHU","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLAVA437YEHU2I7P","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLAVA437","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.16030","citing_title":"Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLAVA437YEHU2I7P6G6H52IQRM","json":"https://pith.science/pith/RLAVA437YEHU2I7P6G6H52IQRM.json","graph_json":"https://pith.science/api/pith-number/RLAVA437YEHU2I7P6G6H52IQRM/graph.json","events_json":"https://pith.science/api/pith-number/RLAVA437YEHU2I7P6G6H52IQRM/events.json","paper":"https://pith.science/paper/RLAVA437"},"agent_actions":{"view_html":"https://pith.science/pith/RLAVA437YEHU2I7P6G6H52IQRM","download_json":"https://pith.science/pith/RLAVA437YEHU2I7P6G6H52IQRM.json","view_paper":"https://pith.science/paper/RLAVA437","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7237&json=true","fetch_graph":"https://pith.science/api/pith-number/RLAVA437YEHU2I7P6G6H52IQRM/graph.json","fetch_events":"https://pith.science/api/pith-number/RLAVA437YEHU2I7P6G6H52IQRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLAVA437YEHU2I7P6G6H52IQRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLAVA437YEHU2I7P6G6H52IQRM/action/storage_attestation","attest_author":"https://pith.science/pith/RLAVA437YEHU2I7P6G6H52IQRM/action/author_attestation","sign_citation":"https://pith.science/pith/RLAVA437YEHU2I7P6G6H52IQRM/action/citation_signature","submit_replication":"https://pith.science/pith/RLAVA437YEHU2I7P6G6H52IQRM/action/replication_record"}},"created_at":"2026-05-18T02:39:17.754246+00:00","updated_at":"2026-05-18T02:39:17.754246+00:00"}