{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:X6HHINIHBQJXDYB4LAE3HUQMAF","short_pith_number":"pith:X6HHINIH","schema_version":"1.0","canonical_sha256":"bf8e7435070c1371e03c5809b3d20c015b23a8d54b88765d5dea03c76a82f3dc","source":{"kind":"arxiv","id":"1412.5842","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.5842","created_at":"2026-05-18T00:41:51.618991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5842v3","created_at":"2026-05-18T00:41:51.618991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5842","created_at":"2026-05-18T00:41:51.618991+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6HHINIHBQJX","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6HHINIHBQJXDYB4","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6HHINIH","created_at":"2026-05-18T12:28:57.508820+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/X6HHINIHBQJXDYB4LAE3HUQMAF","json":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF.json","graph_json":"https://pith.science/api/pith-number/X6HHINIHBQJXDYB4LAE3HUQMAF/graph.json","events_json":"https://pith.science/api/pith-number/X6HHINIHBQJXDYB4LAE3HUQMAF/events.json","paper":"https://pith.science/paper/X6HHINIH"},"agent_actions":{"view_html":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF","download_json":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF.json","view_paper":"https://pith.science/paper/X6HHINIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5842&json=true","fetch_graph":"https://pith.science/api/pith-number/X6HHINIHBQJXDYB4LAE3HUQMAF/graph.json","fetch_events":"https://pith.science/api/pith-number/X6HHINIHBQJXDYB4LAE3HUQMAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF/action/storage_attestation","attest_author":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF/action/author_attestation","sign_citation":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF/action/citation_signature","submit_replication":"https://pith.science/pith/X6HHINIHBQJXDYB4LAE3HUQMAF/action/replication_record"}},"created_at":"2026-05-18T00:41:51.618991+00:00","updated_at":"2026-05-18T00:41:51.618991+00:00"}