{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NM5TJ74AARU5LDZ7I36XMKQQZT","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":"87e1e1c267a2a804d5852dfed4eeaf9bef6e9e2e620cf89cb527dbdde2a14bee","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-19T18:07:41Z","title_canon_sha256":"c6e3c0d6816afef212b92de6fdccc874b89edae790f47bc98ac6caf35ea985bd"},"schema_version":"1.0","source":{"id":"2310.13067","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.13067","created_at":"2026-07-05T10:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"2310.13067v3","created_at":"2026-07-05T10:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.13067","created_at":"2026-07-05T10:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"NM5TJ74AARU5","created_at":"2026-07-05T10:49:03Z"},{"alias_kind":"pith_short_16","alias_value":"NM5TJ74AARU5LDZ7","created_at":"2026-07-05T10:49:03Z"},{"alias_kind":"pith_short_8","alias_value":"NM5TJ74A","created_at":"2026-07-05T10:49:03Z"}],"graph_snapshots":[{"event_id":"sha256:d779ba88336f29717be8e5d76fe5a47a6eeabb96530e1eee5f52174d5aa57a3a","target":"graph","created_at":"2026-07-05T10:49:03Z","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/2310.13067/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A universal partial cycle (or upcycle) for $\\mathcal{A}^n$ is a cyclic sequence that covers each word of length $n$ over the alphabet $\\mathcal{A}$ exactly once -- like a De Bruijn cycle, except that we also allow a wildcard symbol $\\mathord{\\diamond}$ that can represent any letter of $\\mathcal{A}$. Chen et al. in 2017 and Goeckner et al. in 2018 showed that the existence and structure of upcycles are highly constrained, unlike those of De Bruijn cycles, which exist for every alphabet size and word length. Moreover, it was not known whether any upcycles existed for $n \\ge 5$. We present severa","authors_text":"Bennet Goeckner, Daniel McGinnis, Dylan Fillmore, Kirin Martin, Rachel Kirsch","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-19T18:07:41Z","title":"The Existence and Structure of Universal Partial Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.13067","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:3b79f04f2116ad52309ca63b79114b1ad73c3c26613af8ddd641fae78b0d28bf","target":"record","created_at":"2026-07-05T10:49:03Z","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":"87e1e1c267a2a804d5852dfed4eeaf9bef6e9e2e620cf89cb527dbdde2a14bee","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-19T18:07:41Z","title_canon_sha256":"c6e3c0d6816afef212b92de6fdccc874b89edae790f47bc98ac6caf35ea985bd"},"schema_version":"1.0","source":{"id":"2310.13067","kind":"arxiv","version":3}},"canonical_sha256":"6b3b34ff800469d58f3f46fd762a10ccc413b32d3bfd05f14d64842d2addf2a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b3b34ff800469d58f3f46fd762a10ccc413b32d3bfd05f14d64842d2addf2a7","first_computed_at":"2026-07-05T10:49:03.835572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:49:03.835572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"raPtSixxZm/vEflSZbiBmckz1Qd1wN0KX8DCCb5K8qx0v3tcVl8QvINY+QUg40z4sS7xlEZPEQRxufMj8zCeBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:49:03.836001Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.13067","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b79f04f2116ad52309ca63b79114b1ad73c3c26613af8ddd641fae78b0d28bf","sha256:d779ba88336f29717be8e5d76fe5a47a6eeabb96530e1eee5f52174d5aa57a3a"],"state_sha256":"6c9bd089cb5281c51c2a7fbc7ed2791849ef0283e7e1b4c3e4309d7b7b41b3a4"}