{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:R7IOZBFUAGKYQKVD2HN5LYDJPX","short_pith_number":"pith:R7IOZBFU","canonical_record":{"source":{"id":"1304.2820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-10T01:02:07Z","cross_cats_sorted":[],"title_canon_sha256":"3b8a28b0fbf0f3f416dfaf2a5a10b1e6ca96fcb89aa098d25c697336b9451399","abstract_canon_sha256":"20623269c8636ebd9b1c273bffcd30c4683c1bee00607dac643e435e0f433efd"},"schema_version":"1.0"},"canonical_sha256":"8fd0ec84b40195882aa3d1dbd5e0697dc50f5756df76d3949cad7c7a54383023","source":{"kind":"arxiv","id":"1304.2820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2820","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2820v1","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2820","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"R7IOZBFUAGKY","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R7IOZBFUAGKYQKVD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R7IOZBFU","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:R7IOZBFUAGKYQKVD2HN5LYDJPX","target":"record","payload":{"canonical_record":{"source":{"id":"1304.2820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-10T01:02:07Z","cross_cats_sorted":[],"title_canon_sha256":"3b8a28b0fbf0f3f416dfaf2a5a10b1e6ca96fcb89aa098d25c697336b9451399","abstract_canon_sha256":"20623269c8636ebd9b1c273bffcd30c4683c1bee00607dac643e435e0f433efd"},"schema_version":"1.0"},"canonical_sha256":"8fd0ec84b40195882aa3d1dbd5e0697dc50f5756df76d3949cad7c7a54383023","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:28.141350Z","signature_b64":"J/0C9oKXM8l7KzufIQi3YGKP5LWycay7aBUy6B/jDB8Rlgqawl91kGyG9n4iunCBRnGP+uUW5Qki00vptQxcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fd0ec84b40195882aa3d1dbd5e0697dc50f5756df76d3949cad7c7a54383023","last_reissued_at":"2026-05-18T03:28:28.140597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:28.140597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.2820","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:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MeBBGX7JEPqkezmnfhOWH0xNedj4NDHBUZnczjeZVdS2gx9wyXx6e+PkNUSKZjnwF8czMJSU1V1WJjxptH5mDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:09:32.981491Z"},"content_sha256":"1701dfcf3375d4ba774d05be61c7d32476910576a877339758b591544380fb7a","schema_version":"1.0","event_id":"sha256:1701dfcf3375d4ba774d05be61c7d32476910576a877339758b591544380fb7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:R7IOZBFUAGKYQKVD2HN5LYDJPX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contributions to the theory of de Bruijn cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Andre Campbell, Bill Kay","submitted_at":"2013-04-10T01:02:07Z","abstract_excerpt":"A de Bruijn cycle is a cyclic listing of length A, of a collection of A combinatorial objects, so that each object appears exactly once as a set of consecutive elements in the cycle. In this paper, we show the power of de Bruijn's original theorem, namely that the cycles bearing his name exist for n-letter words on a k-letter alphabet for all values of k,n, to prove that we can create de Bruijn cycles for the assignment of elements of [n]={1,2,....,n} to the sets in any labeled subposet of the Boolean lattice; de Bruijn's theorem corresponds to the case when the subposet in question consists o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2820","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:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aHE3ViHz+vX+FcyJoWKse2yZnZqt4AjVA0kci1GL2ihMwm8NBSCDsEiXugFBtlLM6PyAeUDDst2aDuCjb0D2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:09:32.981841Z"},"content_sha256":"c00a3e66cb5047a589911d9233fd56008c8b4ae71a5f7954366eeac0df4ce771","schema_version":"1.0","event_id":"sha256:c00a3e66cb5047a589911d9233fd56008c8b4ae71a5f7954366eeac0df4ce771"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX/bundle.json","state_url":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX/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-20T15:09:32Z","links":{"resolver":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX","bundle":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX/bundle.json","state":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:R7IOZBFUAGKYQKVD2HN5LYDJPX","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":"20623269c8636ebd9b1c273bffcd30c4683c1bee00607dac643e435e0f433efd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-10T01:02:07Z","title_canon_sha256":"3b8a28b0fbf0f3f416dfaf2a5a10b1e6ca96fcb89aa098d25c697336b9451399"},"schema_version":"1.0","source":{"id":"1304.2820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2820","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2820v1","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2820","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"R7IOZBFUAGKY","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R7IOZBFUAGKYQKVD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R7IOZBFU","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:c00a3e66cb5047a589911d9233fd56008c8b4ae71a5f7954366eeac0df4ce771","target":"graph","created_at":"2026-05-18T03:28:28Z","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":"A de Bruijn cycle is a cyclic listing of length A, of a collection of A combinatorial objects, so that each object appears exactly once as a set of consecutive elements in the cycle. In this paper, we show the power of de Bruijn's original theorem, namely that the cycles bearing his name exist for n-letter words on a k-letter alphabet for all values of k,n, to prove that we can create de Bruijn cycles for the assignment of elements of [n]={1,2,....,n} to the sets in any labeled subposet of the Boolean lattice; de Bruijn's theorem corresponds to the case when the subposet in question consists o","authors_text":"Anant Godbole, Andre Campbell, Bill Kay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-10T01:02:07Z","title":"Contributions to the theory of de Bruijn cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2820","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:1701dfcf3375d4ba774d05be61c7d32476910576a877339758b591544380fb7a","target":"record","created_at":"2026-05-18T03:28:28Z","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":"20623269c8636ebd9b1c273bffcd30c4683c1bee00607dac643e435e0f433efd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-10T01:02:07Z","title_canon_sha256":"3b8a28b0fbf0f3f416dfaf2a5a10b1e6ca96fcb89aa098d25c697336b9451399"},"schema_version":"1.0","source":{"id":"1304.2820","kind":"arxiv","version":1}},"canonical_sha256":"8fd0ec84b40195882aa3d1dbd5e0697dc50f5756df76d3949cad7c7a54383023","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fd0ec84b40195882aa3d1dbd5e0697dc50f5756df76d3949cad7c7a54383023","first_computed_at":"2026-05-18T03:28:28.140597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:28.140597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J/0C9oKXM8l7KzufIQi3YGKP5LWycay7aBUy6B/jDB8Rlgqawl91kGyG9n4iunCBRnGP+uUW5Qki00vptQxcCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:28.141350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1701dfcf3375d4ba774d05be61c7d32476910576a877339758b591544380fb7a","sha256:c00a3e66cb5047a589911d9233fd56008c8b4ae71a5f7954366eeac0df4ce771"],"state_sha256":"18dac4e275ebb25c2a226a9ade8593ca359cc33f3b30a133773e9b4060ed1a53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XujIwWgpN4Js7PWHN6fSBB93Zt5hwCkwbZFjYLsMqbm0WTz3Q4yOIOCdLKbDxj5ye8da/7Kk05Na/ubh43NNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T15:09:32.983878Z","bundle_sha256":"d6baec034d755837a89e89c5928729cf7679795b559f97e3be7e8d72bb482d79"}}