{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3HWK7LZNRPEIDRMI4LTAJVMVLQ","short_pith_number":"pith:3HWK7LZN","canonical_record":{"source":{"id":"1705.07835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-22T16:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"8b4044405da098f7a2fa33921ba378e8f3dd271118f47d6df95a94d6730f7a0b","abstract_canon_sha256":"b03a594bcd17a09e22c27f06c60b3d574e58b6c4c9add0c0be512414dfe32acc"},"schema_version":"1.0"},"canonical_sha256":"d9ecafaf2d8bc881c588e2e604d5955c12992aa107ab4129773f26e77a06c0b1","source":{"kind":"arxiv","id":"1705.07835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07835","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07835v1","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07835","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"3HWK7LZNRPEI","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3HWK7LZNRPEIDRMI","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3HWK7LZN","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3HWK7LZNRPEIDRMI4LTAJVMVLQ","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-22T16:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"8b4044405da098f7a2fa33921ba378e8f3dd271118f47d6df95a94d6730f7a0b","abstract_canon_sha256":"b03a594bcd17a09e22c27f06c60b3d574e58b6c4c9add0c0be512414dfe32acc"},"schema_version":"1.0"},"canonical_sha256":"d9ecafaf2d8bc881c588e2e604d5955c12992aa107ab4129773f26e77a06c0b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:04.437552Z","signature_b64":"qDFmIYlg0Jb0R28p1K1bciwVxuGy+8AYJBVUiFcVcUcPY4c0zeaMZEylcPd2k+0wNDHlNFXdcBrVbeyi5CwgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9ecafaf2d8bc881c588e2e604d5955c12992aa107ab4129773f26e77a06c0b1","last_reissued_at":"2026-05-18T00:44:04.436918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:04.436918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07835","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-18T00:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6FHCwH/ObT/6S0CWfKp3QHy7XCHphduZLXTq/zKf5Mv4kXKdCkGBbZAJyiRWaDdJSwRJ0wJeGxjGzrOaSK7MAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:51:57.222166Z"},"content_sha256":"e3de6e080d66e4b78322e5ac5454b1e01018d3c82163e157ff7c4c0d1db70748","schema_version":"1.0","event_id":"sha256:e3de6e080d66e4b78322e5ac5454b1e01018d3c82163e157ff7c4c0d1db70748"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3HWK7LZNRPEIDRMI4LTAJVMVLQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting De Bruijn sequences as perturbations of linear recursions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Don Coppersmith, Jeffrey M. VanderKam, Robert C. Rhoades","submitted_at":"2017-05-22T16:29:08Z","abstract_excerpt":"Every binary De~Bruijn sequence of order n satisfies a recursion 0=x_n+x_0+g(x_{n-1}, ..., x_1). Given a function f on (n-1) bits, let N(f; r) be the number of functions generating a De Bruijn sequence of order n which are obtained by changing r locations in the truth table of f. We prove a formula for the generating function \\sum_r N(\\ell; r) y^r when \\ell is a linear function.\n  The proof uses a weighted Matrix Tree Theorem and a description of the in-trees (or rooted trees) in the n-bit De Bruijn graph as perturbations of the Hamiltonian paths in the same graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07835","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-18T00:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txrr6ETRow3WxyteUjX5rElAUeATFjUhF676as9MW93HeYQ5sQQD57wVZCyc1n83rGvsmmKcASnOJJrAuNEaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:51:57.222527Z"},"content_sha256":"84561ca0426995eacc3d969431a210dc04a25ba3bac0482740c0d878f3333648","schema_version":"1.0","event_id":"sha256:84561ca0426995eacc3d969431a210dc04a25ba3bac0482740c0d878f3333648"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HWK7LZNRPEIDRMI4LTAJVMVLQ/bundle.json","state_url":"https://pith.science/pith/3HWK7LZNRPEIDRMI4LTAJVMVLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HWK7LZNRPEIDRMI4LTAJVMVLQ/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-07-03T12:51:57Z","links":{"resolver":"https://pith.science/pith/3HWK7LZNRPEIDRMI4LTAJVMVLQ","bundle":"https://pith.science/pith/3HWK7LZNRPEIDRMI4LTAJVMVLQ/bundle.json","state":"https://pith.science/pith/3HWK7LZNRPEIDRMI4LTAJVMVLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HWK7LZNRPEIDRMI4LTAJVMVLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3HWK7LZNRPEIDRMI4LTAJVMVLQ","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":"b03a594bcd17a09e22c27f06c60b3d574e58b6c4c9add0c0be512414dfe32acc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-22T16:29:08Z","title_canon_sha256":"8b4044405da098f7a2fa33921ba378e8f3dd271118f47d6df95a94d6730f7a0b"},"schema_version":"1.0","source":{"id":"1705.07835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07835","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07835v1","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07835","created_at":"2026-05-18T00:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"3HWK7LZNRPEI","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3HWK7LZNRPEIDRMI","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3HWK7LZN","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:84561ca0426995eacc3d969431a210dc04a25ba3bac0482740c0d878f3333648","target":"graph","created_at":"2026-05-18T00:44:04Z","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":"Every binary De~Bruijn sequence of order n satisfies a recursion 0=x_n+x_0+g(x_{n-1}, ..., x_1). Given a function f on (n-1) bits, let N(f; r) be the number of functions generating a De Bruijn sequence of order n which are obtained by changing r locations in the truth table of f. We prove a formula for the generating function \\sum_r N(\\ell; r) y^r when \\ell is a linear function.\n  The proof uses a weighted Matrix Tree Theorem and a description of the in-trees (or rooted trees) in the n-bit De Bruijn graph as perturbations of the Hamiltonian paths in the same graph.","authors_text":"Don Coppersmith, Jeffrey M. VanderKam, Robert C. Rhoades","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-22T16:29:08Z","title":"Counting De Bruijn sequences as perturbations of linear recursions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07835","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:e3de6e080d66e4b78322e5ac5454b1e01018d3c82163e157ff7c4c0d1db70748","target":"record","created_at":"2026-05-18T00:44:04Z","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":"b03a594bcd17a09e22c27f06c60b3d574e58b6c4c9add0c0be512414dfe32acc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-22T16:29:08Z","title_canon_sha256":"8b4044405da098f7a2fa33921ba378e8f3dd271118f47d6df95a94d6730f7a0b"},"schema_version":"1.0","source":{"id":"1705.07835","kind":"arxiv","version":1}},"canonical_sha256":"d9ecafaf2d8bc881c588e2e604d5955c12992aa107ab4129773f26e77a06c0b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9ecafaf2d8bc881c588e2e604d5955c12992aa107ab4129773f26e77a06c0b1","first_computed_at":"2026-05-18T00:44:04.436918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:04.436918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qDFmIYlg0Jb0R28p1K1bciwVxuGy+8AYJBVUiFcVcUcPY4c0zeaMZEylcPd2k+0wNDHlNFXdcBrVbeyi5CwgBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:04.437552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3de6e080d66e4b78322e5ac5454b1e01018d3c82163e157ff7c4c0d1db70748","sha256:84561ca0426995eacc3d969431a210dc04a25ba3bac0482740c0d878f3333648"],"state_sha256":"bcb8c9c5accef336f79edcbe95721ea27b7c5de664517f4b6780a1360981e006"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFUrIhYa4OIHa9BH02SuJ0n028E7IaOaDmfUsADFmzHe1GOBlDinHj9L1vssbDsKSyKdoe/IdK+GlElG86cqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T12:51:57.224281Z","bundle_sha256":"5fcb7842d27c34010051e857fed96d2b1b0f8d0a7c0087e2beb550cad40910f0"}}