{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NGFBFFJTCZBZEL2V37MZKPUEXL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"77ae6e9447ebb37eaa6b0ea185a8034ea9ddbea98f26f658468282aa8ecdd618","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-15T19:36:08Z","title_canon_sha256":"535544ab20f06dc4d974d1b1e041d4fdc79aff887ab31a32f19026fde67e1f98"},"schema_version":"1.0","source":{"id":"2507.11681","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11681","created_at":"2026-06-30T01:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11681v3","created_at":"2026-06-30T01:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11681","created_at":"2026-06-30T01:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"NGFBFFJTCZBZ","created_at":"2026-06-30T01:17:24Z"},{"alias_kind":"pith_short_16","alias_value":"NGFBFFJTCZBZEL2V","created_at":"2026-06-30T01:17:24Z"},{"alias_kind":"pith_short_8","alias_value":"NGFBFFJT","created_at":"2026-06-30T01:17:24Z"}],"graph_snapshots":[{"event_id":"sha256:287dc64599069b2a8e51066283ea69ecbe6c7b1127080992591cf178f600d9ea","target":"graph","created_at":"2026-06-30T01:17:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.11681/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Pinwheel Scheduling is a fundamental scheduling problem, in which each task $i$ is associated with a positive integer $d_i$, and the objective is to schedule one task per time slot, ensuring each task perpetually appears at least once in every $d_i$ time slots. Although conjectured to be PSPACE-complete, it remains open whether Pinwheel Scheduling is NP-hard (unless a compact input encoding is used) or even contained in NP.\n  We introduce k-Visits, a finite version of Pinwheel Scheduling, where given n deadlines, the goal is to schedule each task exactly k times. While we observe that the 1-Vi","authors_text":"Aris Pagourtzis, Christos Pergaminelis, Euripides Markou, Maria Kokkou, Sotiris Kanellopoulos","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-15T19:36:08Z","title":"Finite Pinwheel Scheduling: the k-Visits Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11681","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ccb288f69037a9b284d28832331dff69b89e1c34b025eb553ca1ec54cdd85cee","target":"record","created_at":"2026-06-30T01:17:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"77ae6e9447ebb37eaa6b0ea185a8034ea9ddbea98f26f658468282aa8ecdd618","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-15T19:36:08Z","title_canon_sha256":"535544ab20f06dc4d974d1b1e041d4fdc79aff887ab31a32f19026fde67e1f98"},"schema_version":"1.0","source":{"id":"2507.11681","kind":"arxiv","version":3}},"canonical_sha256":"698a1295331643922f55dfd9953e84bafab56d8679f552ddb241b1bf0c48661d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"698a1295331643922f55dfd9953e84bafab56d8679f552ddb241b1bf0c48661d","first_computed_at":"2026-06-30T01:17:24.816730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:17:24.816730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GD1M1Ge8fj5socSCVEQZjb2TXkdWNXLMIU6F14FmALPiZRR04QxqdqMxFHfhYF2m26eXDhq4w1KaJyQZiB0CBA==","signature_status":"signed_v1","signed_at":"2026-06-30T01:17:24.817305Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11681","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccb288f69037a9b284d28832331dff69b89e1c34b025eb553ca1ec54cdd85cee","sha256:287dc64599069b2a8e51066283ea69ecbe6c7b1127080992591cf178f600d9ea"],"state_sha256":"9aa7960ffd46d5e4a29b3f180e7bca2efdc16b56a0dc472f59fc4c10845484b7"}