{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Z3NZIHI4QRMWZ7T7KAMH72PQLT","short_pith_number":"pith:Z3NZIHI4","canonical_record":{"source":{"id":"1203.5169","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-23T03:22:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d176bcc50556829ebbc8c3eabbe8ef858731ef097c4c8c206cff3e3be6526628","abstract_canon_sha256":"a96a0deef13ae5a0c13c012e3d7c15d166223f32a8d2f798f8a1da0afbadabd9"},"schema_version":"1.0"},"canonical_sha256":"cedb941d1c84596cfe7f50187fe9f05cd0d7ce1af4eddf04b1ccc53a9675a3ab","source":{"kind":"arxiv","id":"1203.5169","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5169","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5169v4","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5169","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"Z3NZIHI4QRMW","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z3NZIHI4QRMWZ7T7","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z3NZIHI4","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Z3NZIHI4QRMWZ7T7KAMH72PQLT","target":"record","payload":{"canonical_record":{"source":{"id":"1203.5169","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-23T03:22:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d176bcc50556829ebbc8c3eabbe8ef858731ef097c4c8c206cff3e3be6526628","abstract_canon_sha256":"a96a0deef13ae5a0c13c012e3d7c15d166223f32a8d2f798f8a1da0afbadabd9"},"schema_version":"1.0"},"canonical_sha256":"cedb941d1c84596cfe7f50187fe9f05cd0d7ce1af4eddf04b1ccc53a9675a3ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:06.722597Z","signature_b64":"0rB3Whip3PyMJ3Pu6wADypKt/19VaKCVpZkCN2q7g2fg1C0+xOnw+VNR9kK1bPxREr12Im1k/VS7hrKpCQcqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cedb941d1c84596cfe7f50187fe9f05cd0d7ce1af4eddf04b1ccc53a9675a3ab","last_reissued_at":"2026-05-18T03:20:06.722082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:06.722082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.5169","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9YbfVKmJS3ijY/BEWL/VuxG/b4UwfOh5wQ+RKITflx/pnUFBptRhzwUM+5hvLn9XrihOW5g1LV9SffSGKnfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:06:02.334199Z"},"content_sha256":"ad33df2fa9143bd0d3f80cc46f96fad002def98dcf0a92dd9e95d23b3f53e845","schema_version":"1.0","event_id":"sha256:ad33df2fa9143bd0d3f80cc46f96fad002def98dcf0a92dd9e95d23b3f53e845"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Z3NZIHI4QRMWZ7T7KAMH72PQLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Cycles for Weak Orders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Glenn Hurlbert, Victoria Horan","submitted_at":"2012-03-23T03:22:19Z","abstract_excerpt":"Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1990. They have been developed by many authors since, for various combinatorial objects such as strings, subsets, permutations, partitions, vector spaces, and designs. One generalization of universal cycles, which require almost complete overlap of consecutive words, is s-overlap cycles, which relax such a constraint. In this paper we study weak orders, which are relations that are transitive and complete. We prove the existence of universal and s-overlap cy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5169","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lx0fN1mZWWjZ3lLQaN3D6BxvLvgd/U63GMqanq7CNBq4iX5dxHODB8u0nnIqdeGIoV/cpteAMNn27ESz4upzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:06:02.334545Z"},"content_sha256":"b552b89ecb2dc1266c9a89916ac47ec24751653857c2e29dfeb6d3df9dbf3c25","schema_version":"1.0","event_id":"sha256:b552b89ecb2dc1266c9a89916ac47ec24751653857c2e29dfeb6d3df9dbf3c25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3NZIHI4QRMWZ7T7KAMH72PQLT/bundle.json","state_url":"https://pith.science/pith/Z3NZIHI4QRMWZ7T7KAMH72PQLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3NZIHI4QRMWZ7T7KAMH72PQLT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T02:06:02Z","links":{"resolver":"https://pith.science/pith/Z3NZIHI4QRMWZ7T7KAMH72PQLT","bundle":"https://pith.science/pith/Z3NZIHI4QRMWZ7T7KAMH72PQLT/bundle.json","state":"https://pith.science/pith/Z3NZIHI4QRMWZ7T7KAMH72PQLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3NZIHI4QRMWZ7T7KAMH72PQLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Z3NZIHI4QRMWZ7T7KAMH72PQLT","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":"a96a0deef13ae5a0c13c012e3d7c15d166223f32a8d2f798f8a1da0afbadabd9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-23T03:22:19Z","title_canon_sha256":"d176bcc50556829ebbc8c3eabbe8ef858731ef097c4c8c206cff3e3be6526628"},"schema_version":"1.0","source":{"id":"1203.5169","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5169","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5169v4","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5169","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"Z3NZIHI4QRMW","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z3NZIHI4QRMWZ7T7","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z3NZIHI4","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:b552b89ecb2dc1266c9a89916ac47ec24751653857c2e29dfeb6d3df9dbf3c25","target":"graph","created_at":"2026-05-18T03:20:06Z","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"},"paper":{"abstract_excerpt":"Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1990. They have been developed by many authors since, for various combinatorial objects such as strings, subsets, permutations, partitions, vector spaces, and designs. One generalization of universal cycles, which require almost complete overlap of consecutive words, is s-overlap cycles, which relax such a constraint. In this paper we study weak orders, which are relations that are transitive and complete. We prove the existence of universal and s-overlap cy","authors_text":"Glenn Hurlbert, Victoria Horan","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-23T03:22:19Z","title":"Universal Cycles for Weak Orders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5169","kind":"arxiv","version":4},"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:ad33df2fa9143bd0d3f80cc46f96fad002def98dcf0a92dd9e95d23b3f53e845","target":"record","created_at":"2026-05-18T03:20:06Z","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":"a96a0deef13ae5a0c13c012e3d7c15d166223f32a8d2f798f8a1da0afbadabd9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-23T03:22:19Z","title_canon_sha256":"d176bcc50556829ebbc8c3eabbe8ef858731ef097c4c8c206cff3e3be6526628"},"schema_version":"1.0","source":{"id":"1203.5169","kind":"arxiv","version":4}},"canonical_sha256":"cedb941d1c84596cfe7f50187fe9f05cd0d7ce1af4eddf04b1ccc53a9675a3ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cedb941d1c84596cfe7f50187fe9f05cd0d7ce1af4eddf04b1ccc53a9675a3ab","first_computed_at":"2026-05-18T03:20:06.722082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:06.722082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0rB3Whip3PyMJ3Pu6wADypKt/19VaKCVpZkCN2q7g2fg1C0+xOnw+VNR9kK1bPxREr12Im1k/VS7hrKpCQcqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:06.722597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5169","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad33df2fa9143bd0d3f80cc46f96fad002def98dcf0a92dd9e95d23b3f53e845","sha256:b552b89ecb2dc1266c9a89916ac47ec24751653857c2e29dfeb6d3df9dbf3c25"],"state_sha256":"1df912d69ae7280ae0030f14f930d04da01ff21373ce1dd466bcf9129a03230c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLYrA0poKR+0u8pUiPvNewT93c4FNlcHDn/ozDSmOnu9WAXHs/XG+Te5OSeSDH0SFdc5oqd1WEBYtcswu3ZtDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T02:06:02.336345Z","bundle_sha256":"e88bf854dc71cfa9286cf466ac3e8b98dfb2137742abccada5bc748fc9f65413"}}