{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:X6HHINIHBQJXDYB4LAE3HUQMAF","short_pith_number":"pith:X6HHINIH","canonical_record":{"source":{"id":"1412.5842","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-18T12:59:54Z","cross_cats_sorted":[],"title_canon_sha256":"a3ad1930b232d54118b01371e628dab8b68386a08fe032fd70ea4ce2b9cb3147","abstract_canon_sha256":"e57766225383a42fd915fdff8e44de7f2d1b17a5d581a310c3a44e5a07ea3f0c"},"schema_version":"1.0"},"canonical_sha256":"bf8e7435070c1371e03c5809b3d20c015b23a8d54b88765d5dea03c76a82f3dc","source":{"kind":"arxiv","id":"1412.5842","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5842","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5842v3","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5842","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"X6HHINIHBQJX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X6HHINIHBQJXDYB4","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X6HHINIH","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:X6HHINIHBQJXDYB4LAE3HUQMAF","target":"record","payload":{"canonical_record":{"source":{"id":"1412.5842","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-18T12:59:54Z","cross_cats_sorted":[],"title_canon_sha256":"a3ad1930b232d54118b01371e628dab8b68386a08fe032fd70ea4ce2b9cb3147","abstract_canon_sha256":"e57766225383a42fd915fdff8e44de7f2d1b17a5d581a310c3a44e5a07ea3f0c"},"schema_version":"1.0"},"canonical_sha256":"bf8e7435070c1371e03c5809b3d20c015b23a8d54b88765d5dea03c76a82f3dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:51.619629Z","signature_b64":"OFasD8bRlFjKMSkY5HzWQYdMfh2nAj4WiKM1prZ7S/dX/12l9+0FkBp6MIzhNwenRbMC8Vz+rUz0qGcvOfvnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf8e7435070c1371e03c5809b3d20c015b23a8d54b88765d5dea03c76a82f3dc","last_reissued_at":"2026-05-18T00:41:51.618913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:51.618913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.5842","source_version":3,"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:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Y08OYL2ZeVjLaxiUTlQUUI+I/UScPKmBNZWQSlZnR1NajiTGC+T/02AIWr7uCMA4ylqrhGcxW1lfk+nArb9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T05:38:24.079897Z"},"content_sha256":"2e7c2beda16097999a7e9ab10f50ca00de560e1f82cf48881c25cd5f51ec7f26","schema_version":"1.0","event_id":"sha256:2e7c2beda16097999a7e9ab10f50ca00de560e1f82cf48881c25cd5f51ec7f26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:X6HHINIHBQJXDYB4LAE3HUQMAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identifying Codes on Directed De Bruijn Graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Debra Boutin, Mikko Pelto, Victoria Horan Goliber","submitted_at":"2014-12-18T12:59:54Z","abstract_excerpt":"For a directed graph $G$, a $t$-identifying code is a subset $S\\subseteq V(G)$ with the property that for each vertex $v\\in V(G)$ the set of vertices of $S$ reachable from $v$ by a directed path of length at most $t$ is both non-empty and unique. A graph is called {\\it $t$-identifiable} if there exists a $t$-identifying code. This paper shows that the de~Bruijn graph $\\vec{\\mathcal{B}}(d,n)$ is $t$-identifiable if and only if $n \\geq 2t-1$. It is also shown that a $t$-identifying code for $t$-identifiable de~Bruijn graphs must contain at least $d^{n-1}(d-1)$ vertices, and constructions are giv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5842","kind":"arxiv","version":3},"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:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kRC7NAbQVhZpkxXyoE0q4smdIHqXjRbfUm0127ltPHs2+8zymes+P9kT04mtminhJECoHYJa23jK0cL9rTnSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T05:38:24.080729Z"},"content_sha256":"dd48ca058f221dba5f9f44fd2c34b3b825bbb0149c33bed41966a933f3b2a80d","schema_version":"1.0","event_id":"sha256:dd48ca058f221dba5f9f44fd2c34b3b825bbb0149c33bed41966a933f3b2a80d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF/bundle.json","state_url":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6HHINIHBQJXDYB4LAE3HUQMAF/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-30T05:38:24Z","links":{"resolver":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF","bundle":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF/bundle.json","state":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6HHINIHBQJXDYB4LAE3HUQMAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:X6HHINIHBQJXDYB4LAE3HUQMAF","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":"e57766225383a42fd915fdff8e44de7f2d1b17a5d581a310c3a44e5a07ea3f0c","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-18T12:59:54Z","title_canon_sha256":"a3ad1930b232d54118b01371e628dab8b68386a08fe032fd70ea4ce2b9cb3147"},"schema_version":"1.0","source":{"id":"1412.5842","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5842","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5842v3","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5842","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"X6HHINIHBQJX","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X6HHINIHBQJXDYB4","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X6HHINIH","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:dd48ca058f221dba5f9f44fd2c34b3b825bbb0149c33bed41966a933f3b2a80d","target":"graph","created_at":"2026-05-18T00:41:51Z","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":"For a directed graph $G$, a $t$-identifying code is a subset $S\\subseteq V(G)$ with the property that for each vertex $v\\in V(G)$ the set of vertices of $S$ reachable from $v$ by a directed path of length at most $t$ is both non-empty and unique. A graph is called {\\it $t$-identifiable} if there exists a $t$-identifying code. This paper shows that the de~Bruijn graph $\\vec{\\mathcal{B}}(d,n)$ is $t$-identifiable if and only if $n \\geq 2t-1$. It is also shown that a $t$-identifying code for $t$-identifiable de~Bruijn graphs must contain at least $d^{n-1}(d-1)$ vertices, and constructions are giv","authors_text":"Debra Boutin, Mikko Pelto, Victoria Horan Goliber","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-18T12:59:54Z","title":"Identifying Codes on Directed De Bruijn Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5842","kind":"arxiv","version":3},"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:2e7c2beda16097999a7e9ab10f50ca00de560e1f82cf48881c25cd5f51ec7f26","target":"record","created_at":"2026-05-18T00:41:51Z","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":"e57766225383a42fd915fdff8e44de7f2d1b17a5d581a310c3a44e5a07ea3f0c","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-18T12:59:54Z","title_canon_sha256":"a3ad1930b232d54118b01371e628dab8b68386a08fe032fd70ea4ce2b9cb3147"},"schema_version":"1.0","source":{"id":"1412.5842","kind":"arxiv","version":3}},"canonical_sha256":"bf8e7435070c1371e03c5809b3d20c015b23a8d54b88765d5dea03c76a82f3dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf8e7435070c1371e03c5809b3d20c015b23a8d54b88765d5dea03c76a82f3dc","first_computed_at":"2026-05-18T00:41:51.618913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:51.618913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OFasD8bRlFjKMSkY5HzWQYdMfh2nAj4WiKM1prZ7S/dX/12l9+0FkBp6MIzhNwenRbMC8Vz+rUz0qGcvOfvnCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:51.619629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.5842","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e7c2beda16097999a7e9ab10f50ca00de560e1f82cf48881c25cd5f51ec7f26","sha256:dd48ca058f221dba5f9f44fd2c34b3b825bbb0149c33bed41966a933f3b2a80d"],"state_sha256":"c46b07fe36d0a820083f382f11b76beb73fe53e0b50f707b8570c93d2f05d880"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIrQyKYWazv1gawSXo/EuDlluSf79215dVDjjaoBcpSFKgfPddIxu2urnIHwktBIzufN1EXVkv3fzL4RNClTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T05:38:24.084689Z","bundle_sha256":"efde115c48f25c2d350eeaaedff47dd38a4614871ee088eb62072cc2d71c16d3"}}