{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:SRYVQJENX36QTHHC3YWJ3BVUNX","short_pith_number":"pith:SRYVQJEN","canonical_record":{"source":{"id":"0905.3820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-23T18:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"871c8e1c6fc417226697bab1fac1af25f88920f5be2eddf3ffcace61aa339ec3","abstract_canon_sha256":"d1c322a29277fb93c1b7acad0b95ec52f606743f78b5544a09b900fc39cf88bd"},"schema_version":"1.0"},"canonical_sha256":"947158248dbefd099ce2de2c9d86b46df3ac948b8885ca3ca9a12f23a17dbd66","source":{"kind":"arxiv","id":"0905.3820","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.3820","created_at":"2026-05-18T04:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"0905.3820v2","created_at":"2026-05-18T04:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3820","created_at":"2026-05-18T04:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"SRYVQJENX36Q","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SRYVQJENX36QTHHC","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SRYVQJEN","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:SRYVQJENX36QTHHC3YWJ3BVUNX","target":"record","payload":{"canonical_record":{"source":{"id":"0905.3820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-23T18:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"871c8e1c6fc417226697bab1fac1af25f88920f5be2eddf3ffcace61aa339ec3","abstract_canon_sha256":"d1c322a29277fb93c1b7acad0b95ec52f606743f78b5544a09b900fc39cf88bd"},"schema_version":"1.0"},"canonical_sha256":"947158248dbefd099ce2de2c9d86b46df3ac948b8885ca3ca9a12f23a17dbd66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:10.547474Z","signature_b64":"3OoP6vRmsYdGKDOJfcPAarchvj65vVK8gQEshfPcfQMWdPQGM8Jvch+F8QneOyU2PhwgqS3j3RLv0YWb3w3qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"947158248dbefd099ce2de2c9d86b46df3ac948b8885ca3ca9a12f23a17dbd66","last_reissued_at":"2026-05-18T04:40:10.546752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:10.546752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.3820","source_version":2,"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-18T04:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1W6k+XCMLNvi2vFGc0H91D38HqdlnTAL9iosUxm0TujhgrfRCylarR49vqBu7Isnndgiil9daFlWuqVHPQEgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:33:25.999882Z"},"content_sha256":"bc92d3be738c5e03e8335ed81789cbac5cc19fde643a99085c80af642ca120b6","schema_version":"1.0","event_id":"sha256:bc92d3be738c5e03e8335ed81789cbac5cc19fde643a99085c80af642ca120b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:SRYVQJENX36QTHHC3YWJ3BVUNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The maximum independent sets of de Bruijn graphs of diameter 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dustin A. Cartwright, Enrique A. Tobis, Maria Angelica Cueto","submitted_at":"2009-05-23T18:28:35Z","abstract_excerpt":"The nodes of the de Bruijn graph B(d,3) consist of all strings of length 3, taken from an alphabet of size d, with edges between words which are distinct substrings of a word of length 4. We give an inductive characterization of the maximum independent sets of the de Bruijn graphs B(d,3) and for the de Bruijn graph of diameter three with loops removed, for arbitrary alphabet size. We derive a recurrence relation and an exponential generating function for their number. This recurrence allows us to construct exponentially many comma-free codes of length 3 with maximal cardinality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3820","kind":"arxiv","version":2},"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-18T04:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdZaWp4B2zIOJ6DEnC2TiqCQPEQx3o5lmnpKnD1KvNgH3X/uMKcGAKkeHAzIuAjSYtZMBUo9YVqIoiLCP2ohDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:33:26.000260Z"},"content_sha256":"34513993a0209406c4b6153e154f533aaeff47e6f975b97d5bf2e927530cf5f3","schema_version":"1.0","event_id":"sha256:34513993a0209406c4b6153e154f533aaeff47e6f975b97d5bf2e927530cf5f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRYVQJENX36QTHHC3YWJ3BVUNX/bundle.json","state_url":"https://pith.science/pith/SRYVQJENX36QTHHC3YWJ3BVUNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRYVQJENX36QTHHC3YWJ3BVUNX/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-11T23:33:26Z","links":{"resolver":"https://pith.science/pith/SRYVQJENX36QTHHC3YWJ3BVUNX","bundle":"https://pith.science/pith/SRYVQJENX36QTHHC3YWJ3BVUNX/bundle.json","state":"https://pith.science/pith/SRYVQJENX36QTHHC3YWJ3BVUNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRYVQJENX36QTHHC3YWJ3BVUNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:SRYVQJENX36QTHHC3YWJ3BVUNX","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":"d1c322a29277fb93c1b7acad0b95ec52f606743f78b5544a09b900fc39cf88bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-23T18:28:35Z","title_canon_sha256":"871c8e1c6fc417226697bab1fac1af25f88920f5be2eddf3ffcace61aa339ec3"},"schema_version":"1.0","source":{"id":"0905.3820","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.3820","created_at":"2026-05-18T04:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"0905.3820v2","created_at":"2026-05-18T04:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3820","created_at":"2026-05-18T04:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"SRYVQJENX36Q","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SRYVQJENX36QTHHC","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SRYVQJEN","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:34513993a0209406c4b6153e154f533aaeff47e6f975b97d5bf2e927530cf5f3","target":"graph","created_at":"2026-05-18T04:40:10Z","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":"The nodes of the de Bruijn graph B(d,3) consist of all strings of length 3, taken from an alphabet of size d, with edges between words which are distinct substrings of a word of length 4. We give an inductive characterization of the maximum independent sets of the de Bruijn graphs B(d,3) and for the de Bruijn graph of diameter three with loops removed, for arbitrary alphabet size. We derive a recurrence relation and an exponential generating function for their number. This recurrence allows us to construct exponentially many comma-free codes of length 3 with maximal cardinality.","authors_text":"Dustin A. Cartwright, Enrique A. Tobis, Maria Angelica Cueto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-23T18:28:35Z","title":"The maximum independent sets of de Bruijn graphs of diameter 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3820","kind":"arxiv","version":2},"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:bc92d3be738c5e03e8335ed81789cbac5cc19fde643a99085c80af642ca120b6","target":"record","created_at":"2026-05-18T04:40:10Z","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":"d1c322a29277fb93c1b7acad0b95ec52f606743f78b5544a09b900fc39cf88bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-23T18:28:35Z","title_canon_sha256":"871c8e1c6fc417226697bab1fac1af25f88920f5be2eddf3ffcace61aa339ec3"},"schema_version":"1.0","source":{"id":"0905.3820","kind":"arxiv","version":2}},"canonical_sha256":"947158248dbefd099ce2de2c9d86b46df3ac948b8885ca3ca9a12f23a17dbd66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"947158248dbefd099ce2de2c9d86b46df3ac948b8885ca3ca9a12f23a17dbd66","first_computed_at":"2026-05-18T04:40:10.546752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:10.546752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3OoP6vRmsYdGKDOJfcPAarchvj65vVK8gQEshfPcfQMWdPQGM8Jvch+F8QneOyU2PhwgqS3j3RLv0YWb3w3qBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:10.547474Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.3820","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc92d3be738c5e03e8335ed81789cbac5cc19fde643a99085c80af642ca120b6","sha256:34513993a0209406c4b6153e154f533aaeff47e6f975b97d5bf2e927530cf5f3"],"state_sha256":"cde5745d9512947736b6d704ba3f7fcf5dcdf83c75a14252cf68ea16257d85a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDrkUaWVcTyEEk2w+AfrezSXbx+L9NO1VW14P1tOJ1AtHiB/TPIr5puEmcyiALL6irG2HXsYGjm88lox6DLgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:33:26.002400Z","bundle_sha256":"db1ec8c70ea998f840c0a3fa51e34bb242c3ebc4d09babe0eb130cd915b2b28b"}}