{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EVHXUMUOR2ZEQEH4QONFERGNJ2","short_pith_number":"pith:EVHXUMUO","schema_version":"1.0","canonical_sha256":"254f7a328e8eb24810fc839a5244cd4e80e29b06ad28f9a1338da94871f3a542","source":{"kind":"arxiv","id":"1508.00403","version":1},"attestation_state":"computed","paper":{"title":"On the Existence of $t$-Identifying Codes in Undirected De Bruijn Graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Victoria Horan","submitted_at":"2015-08-03T12:56:39Z","abstract_excerpt":"This paper proves the existence of $t$-identifying codes on the class of undirected de Bruijn graphs with string length $n$ and alphabet size $d$, referred to as $\\mathcal{B}(d,n)$. It is shown that $\\mathcal{B}(d,n)$ is $t$-identifiable whenever $d \\geq 3$ and $n \\geq 2t$, and $t \\geq 1$. We also show that $\\mathcal{B}(d,n)$ is $t$-identifiable if either $d \\geq 3$, $n \\geq 3$, and $t=2$, or if $d = 2$, $n \\geq 3$, and $t=1$. The remaining cases remain open. Additionally, we show that the eccentricity of the undirected non-binary de Bruijn graph is $n$."},"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":"1508.00403","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-03T12:56:39Z","cross_cats_sorted":[],"title_canon_sha256":"aba5b5aa8f9b9c39d8f0e0ac788a309093eaac00ecd50aecfe31061c75bbf5e2","abstract_canon_sha256":"66650f9be1a0d2cdf670c1809ed8710281cc651116b95e21795e80b30910b851"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:58.192224Z","signature_b64":"4OzzbAA7yOh1RKfXNRUXY/P5T1rYSY3IrNoEy3JknNffW3J1DrA0Q4/ItIfEHfdUux+ddZW01M0SDiCtQYu9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"254f7a328e8eb24810fc839a5244cd4e80e29b06ad28f9a1338da94871f3a542","last_reissued_at":"2026-05-18T01:35:58.191786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:58.191786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Existence of $t$-Identifying Codes in Undirected De Bruijn Graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Victoria Horan","submitted_at":"2015-08-03T12:56:39Z","abstract_excerpt":"This paper proves the existence of $t$-identifying codes on the class of undirected de Bruijn graphs with string length $n$ and alphabet size $d$, referred to as $\\mathcal{B}(d,n)$. It is shown that $\\mathcal{B}(d,n)$ is $t$-identifiable whenever $d \\geq 3$ and $n \\geq 2t$, and $t \\geq 1$. We also show that $\\mathcal{B}(d,n)$ is $t$-identifiable if either $d \\geq 3$, $n \\geq 3$, and $t=2$, or if $d = 2$, $n \\geq 3$, and $t=1$. The remaining cases remain open. Additionally, we show that the eccentricity of the undirected non-binary de Bruijn graph is $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00403","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":"1508.00403","created_at":"2026-05-18T01:35:58.191856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00403v1","created_at":"2026-05-18T01:35:58.191856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00403","created_at":"2026-05-18T01:35:58.191856+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVHXUMUOR2ZE","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVHXUMUOR2ZEQEH4","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVHXUMUO","created_at":"2026-05-18T12:29:19.899920+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/EVHXUMUOR2ZEQEH4QONFERGNJ2","json":"https://pith.science/pith/EVHXUMUOR2ZEQEH4QONFERGNJ2.json","graph_json":"https://pith.science/api/pith-number/EVHXUMUOR2ZEQEH4QONFERGNJ2/graph.json","events_json":"https://pith.science/api/pith-number/EVHXUMUOR2ZEQEH4QONFERGNJ2/events.json","paper":"https://pith.science/paper/EVHXUMUO"},"agent_actions":{"view_html":"https://pith.science/pith/EVHXUMUOR2ZEQEH4QONFERGNJ2","download_json":"https://pith.science/pith/EVHXUMUOR2ZEQEH4QONFERGNJ2.json","view_paper":"https://pith.science/paper/EVHXUMUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00403&json=true","fetch_graph":"https://pith.science/api/pith-number/EVHXUMUOR2ZEQEH4QONFERGNJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/EVHXUMUOR2ZEQEH4QONFERGNJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVHXUMUOR2ZEQEH4QONFERGNJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVHXUMUOR2ZEQEH4QONFERGNJ2/action/storage_attestation","attest_author":"https://pith.science/pith/EVHXUMUOR2ZEQEH4QONFERGNJ2/action/author_attestation","sign_citation":"https://pith.science/pith/EVHXUMUOR2ZEQEH4QONFERGNJ2/action/citation_signature","submit_replication":"https://pith.science/pith/EVHXUMUOR2ZEQEH4QONFERGNJ2/action/replication_record"}},"created_at":"2026-05-18T01:35:58.191856+00:00","updated_at":"2026-05-18T01:35:58.191856+00:00"}