{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BIV7RV2HDR63KFLDTFAF4VVGV4","short_pith_number":"pith:BIV7RV2H","canonical_record":{"source":{"id":"1303.3323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-14T01:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"5818aabbf0cd4a9003862c940bf6565c471f313b58f65e4f24d81e6346b92caf","abstract_canon_sha256":"727cb7ff8852d015f42eefdf62aeac07d9248c26093d11f6ffc54fd46806897b"},"schema_version":"1.0"},"canonical_sha256":"0a2bf8d7471c7db5156399405e56a6af0ce482672d25172c23934b069c860887","source":{"kind":"arxiv","id":"1303.3323","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3323","created_at":"2026-05-18T03:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3323v1","created_at":"2026-05-18T03:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3323","created_at":"2026-05-18T03:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"BIV7RV2HDR63","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BIV7RV2HDR63KFLD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BIV7RV2H","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BIV7RV2HDR63KFLDTFAF4VVGV4","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-14T01:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"5818aabbf0cd4a9003862c940bf6565c471f313b58f65e4f24d81e6346b92caf","abstract_canon_sha256":"727cb7ff8852d015f42eefdf62aeac07d9248c26093d11f6ffc54fd46806897b"},"schema_version":"1.0"},"canonical_sha256":"0a2bf8d7471c7db5156399405e56a6af0ce482672d25172c23934b069c860887","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:55.815696Z","signature_b64":"ah03L8GfQFlhynvfFQpWEzlOMWj4iGQrx+RP5hvFG39kSZ/UlPLEzlnOzRMyUALhVL3h6T3fkMFb02AANEDtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a2bf8d7471c7db5156399405e56a6af0ce482672d25172c23934b069c860887","last_reissued_at":"2026-05-18T03:30:55.814868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:55.814868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3323","source_version":1,"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:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05U13u4Nsul5XVw2HyW2UQb9sXj64iNe7LB351SHWoxTtwEd1wdydhtumR2Jd2BovvT76oMZiuf37rtXVPzLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:39:35.561079Z"},"content_sha256":"fce47facbed004da162779553c32fec047231d19a555a15d0ffb626b253518fe","schema_version":"1.0","event_id":"sha256:fce47facbed004da162779553c32fec047231d19a555a15d0ffb626b253518fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BIV7RV2HDR63KFLDTFAF4VVGV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Cycles of Complementary Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Beverly Tomlinson, Michelle Champlin","submitted_at":"2013-03-14T01:08:46Z","abstract_excerpt":"Universal Cycles, or U-cycles, as originally defined by de Bruijn, are an efficient method to exhibit a large class of combinatorial objects in a compressed fashion, and with no repeats. de Bruijn's theorem states that U-cycles for $n$ letter words on a $k$ letter alphabet exist for all $k$ and $n$. Much has already been proved about Universal Cycles for a variety of other objects. This work is intended to augment the current research in the area by exhibiting U-cycles for {\\it complementary classes}. Results will be presented that exhibit the existence of U-cycles for class-alternating words "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3323","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"},"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:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Za8NcD7eqdsl2t83/1tnAMjsmAsf7k/tMC3pSxknHwenASL/P1trjEgU0G5bjUpLpTQd2Z3h64BZasevzMXMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:39:35.561443Z"},"content_sha256":"f304dd8fa5e678da07b5e56606a6e727edb7615ce69c6371372e06dd98cbc0f5","schema_version":"1.0","event_id":"sha256:f304dd8fa5e678da07b5e56606a6e727edb7615ce69c6371372e06dd98cbc0f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BIV7RV2HDR63KFLDTFAF4VVGV4/bundle.json","state_url":"https://pith.science/pith/BIV7RV2HDR63KFLDTFAF4VVGV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BIV7RV2HDR63KFLDTFAF4VVGV4/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-03T19:39:35Z","links":{"resolver":"https://pith.science/pith/BIV7RV2HDR63KFLDTFAF4VVGV4","bundle":"https://pith.science/pith/BIV7RV2HDR63KFLDTFAF4VVGV4/bundle.json","state":"https://pith.science/pith/BIV7RV2HDR63KFLDTFAF4VVGV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BIV7RV2HDR63KFLDTFAF4VVGV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BIV7RV2HDR63KFLDTFAF4VVGV4","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":"727cb7ff8852d015f42eefdf62aeac07d9248c26093d11f6ffc54fd46806897b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-14T01:08:46Z","title_canon_sha256":"5818aabbf0cd4a9003862c940bf6565c471f313b58f65e4f24d81e6346b92caf"},"schema_version":"1.0","source":{"id":"1303.3323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3323","created_at":"2026-05-18T03:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3323v1","created_at":"2026-05-18T03:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3323","created_at":"2026-05-18T03:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"BIV7RV2HDR63","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BIV7RV2HDR63KFLD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BIV7RV2H","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:f304dd8fa5e678da07b5e56606a6e727edb7615ce69c6371372e06dd98cbc0f5","target":"graph","created_at":"2026-05-18T03:30:55Z","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, or U-cycles, as originally defined by de Bruijn, are an efficient method to exhibit a large class of combinatorial objects in a compressed fashion, and with no repeats. de Bruijn's theorem states that U-cycles for $n$ letter words on a $k$ letter alphabet exist for all $k$ and $n$. Much has already been proved about Universal Cycles for a variety of other objects. This work is intended to augment the current research in the area by exhibiting U-cycles for {\\it complementary classes}. Results will be presented that exhibit the existence of U-cycles for class-alternating words ","authors_text":"Anant Godbole, Beverly Tomlinson, Michelle Champlin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-14T01:08:46Z","title":"Universal Cycles of Complementary Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3323","kind":"arxiv","version":1},"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:fce47facbed004da162779553c32fec047231d19a555a15d0ffb626b253518fe","target":"record","created_at":"2026-05-18T03:30:55Z","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":"727cb7ff8852d015f42eefdf62aeac07d9248c26093d11f6ffc54fd46806897b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-14T01:08:46Z","title_canon_sha256":"5818aabbf0cd4a9003862c940bf6565c471f313b58f65e4f24d81e6346b92caf"},"schema_version":"1.0","source":{"id":"1303.3323","kind":"arxiv","version":1}},"canonical_sha256":"0a2bf8d7471c7db5156399405e56a6af0ce482672d25172c23934b069c860887","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a2bf8d7471c7db5156399405e56a6af0ce482672d25172c23934b069c860887","first_computed_at":"2026-05-18T03:30:55.814868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:55.814868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ah03L8GfQFlhynvfFQpWEzlOMWj4iGQrx+RP5hvFG39kSZ/UlPLEzlnOzRMyUALhVL3h6T3fkMFb02AANEDtAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:55.815696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fce47facbed004da162779553c32fec047231d19a555a15d0ffb626b253518fe","sha256:f304dd8fa5e678da07b5e56606a6e727edb7615ce69c6371372e06dd98cbc0f5"],"state_sha256":"0d680a9dd6b3158199cced3a35848c6ead89ae2558f83f3e773c038c4daa9cde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Akf6LdmALojphk9BRpuJMyaof84iMPOmcmSToZHe710tP+GYIOGv4BLvt1Eh1IIQLViGKLNP+trd43Upy3RmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:39:35.563402Z","bundle_sha256":"6f9c1c89067cdbd70ae8d1fd972fc449ac4fd1c7719918d57788a6eadc72ffba"}}