{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:R7IOZBFUAGKYQKVD2HN5LYDJPX","short_pith_number":"pith:R7IOZBFU","schema_version":"1.0","canonical_sha256":"8fd0ec84b40195882aa3d1dbd5e0697dc50f5756df76d3949cad7c7a54383023","source":{"kind":"arxiv","id":"1304.2820","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.2820","created_at":"2026-05-18T03:28:28.140695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2820v1","created_at":"2026-05-18T03:28:28.140695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2820","created_at":"2026-05-18T03:28:28.140695+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7IOZBFUAGKY","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7IOZBFUAGKYQKVD","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7IOZBFU","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX","json":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX.json","graph_json":"https://pith.science/api/pith-number/R7IOZBFUAGKYQKVD2HN5LYDJPX/graph.json","events_json":"https://pith.science/api/pith-number/R7IOZBFUAGKYQKVD2HN5LYDJPX/events.json","paper":"https://pith.science/paper/R7IOZBFU"},"agent_actions":{"view_html":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX","download_json":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX.json","view_paper":"https://pith.science/paper/R7IOZBFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2820&json=true","fetch_graph":"https://pith.science/api/pith-number/R7IOZBFUAGKYQKVD2HN5LYDJPX/graph.json","fetch_events":"https://pith.science/api/pith-number/R7IOZBFUAGKYQKVD2HN5LYDJPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX/action/storage_attestation","attest_author":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX/action/author_attestation","sign_citation":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX/action/citation_signature","submit_replication":"https://pith.science/pith/R7IOZBFUAGKYQKVD2HN5LYDJPX/action/replication_record"}},"created_at":"2026-05-18T03:28:28.140695+00:00","updated_at":"2026-05-18T03:28:28.140695+00:00"}