{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JUTNCG5HW4ZPVQOMIRA6KDZGV2","short_pith_number":"pith:JUTNCG5H","schema_version":"1.0","canonical_sha256":"4d26d11ba7b732fac1cc4441e50f26ae822bce1814ad6f96252f8ebcce319142","source":{"kind":"arxiv","id":"1607.03848","version":2},"attestation_state":"computed","paper":{"title":"Periodicity of identifying codes in strips","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Minghui Jiang","submitted_at":"2016-07-13T18:14:32Z","abstract_excerpt":"An identifying code in a graph is a subset of vertices having a nonempty and distinct intersection with the closed neighborhood of every vertex. We prove that the infimum density of any identifying code in $S_k$ (an infinite strip of $k$ rows in the square grid) can always be achieved by a periodic identifying code with pattern length at most $2^{4k}$. Assisted by a compute program implementing Karp's algorithm for minimum cycle mean, we find a periodic identifying code in $S_4$ with the minimum density $11/28$, and a periodic identifying code in $S_5$ with the minimum density $19/50$."},"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":"1607.03848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-13T18:14:32Z","cross_cats_sorted":[],"title_canon_sha256":"5b1e7d39ca9cc4e4344a6679cdb7189eab320728e307759df2cc3e29a5366cb9","abstract_canon_sha256":"74e01edd838c5bba3d85616c8746bb5f5f56b983187d03c81a17352c7d2ec7e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:12.485621Z","signature_b64":"fe5Iy3/xle91YAGTDWfTjLCUyB3z6IPEgb1V7ACKxsjjXLA3YQh0UpJhAhx+Yop16CnuRrOJuNZmkgKot3TsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d26d11ba7b732fac1cc4441e50f26ae822bce1814ad6f96252f8ebcce319142","last_reissued_at":"2026-05-18T01:02:12.485147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:12.485147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Periodicity of identifying codes in strips","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Minghui Jiang","submitted_at":"2016-07-13T18:14:32Z","abstract_excerpt":"An identifying code in a graph is a subset of vertices having a nonempty and distinct intersection with the closed neighborhood of every vertex. We prove that the infimum density of any identifying code in $S_k$ (an infinite strip of $k$ rows in the square grid) can always be achieved by a periodic identifying code with pattern length at most $2^{4k}$. Assisted by a compute program implementing Karp's algorithm for minimum cycle mean, we find a periodic identifying code in $S_4$ with the minimum density $11/28$, and a periodic identifying code in $S_5$ with the minimum density $19/50$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03848","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.03848","created_at":"2026-05-18T01:02:12.485215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03848v2","created_at":"2026-05-18T01:02:12.485215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03848","created_at":"2026-05-18T01:02:12.485215+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUTNCG5HW4ZP","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUTNCG5HW4ZPVQOM","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUTNCG5H","created_at":"2026-05-18T12:30:25.849896+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/JUTNCG5HW4ZPVQOMIRA6KDZGV2","json":"https://pith.science/pith/JUTNCG5HW4ZPVQOMIRA6KDZGV2.json","graph_json":"https://pith.science/api/pith-number/JUTNCG5HW4ZPVQOMIRA6KDZGV2/graph.json","events_json":"https://pith.science/api/pith-number/JUTNCG5HW4ZPVQOMIRA6KDZGV2/events.json","paper":"https://pith.science/paper/JUTNCG5H"},"agent_actions":{"view_html":"https://pith.science/pith/JUTNCG5HW4ZPVQOMIRA6KDZGV2","download_json":"https://pith.science/pith/JUTNCG5HW4ZPVQOMIRA6KDZGV2.json","view_paper":"https://pith.science/paper/JUTNCG5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03848&json=true","fetch_graph":"https://pith.science/api/pith-number/JUTNCG5HW4ZPVQOMIRA6KDZGV2/graph.json","fetch_events":"https://pith.science/api/pith-number/JUTNCG5HW4ZPVQOMIRA6KDZGV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUTNCG5HW4ZPVQOMIRA6KDZGV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUTNCG5HW4ZPVQOMIRA6KDZGV2/action/storage_attestation","attest_author":"https://pith.science/pith/JUTNCG5HW4ZPVQOMIRA6KDZGV2/action/author_attestation","sign_citation":"https://pith.science/pith/JUTNCG5HW4ZPVQOMIRA6KDZGV2/action/citation_signature","submit_replication":"https://pith.science/pith/JUTNCG5HW4ZPVQOMIRA6KDZGV2/action/replication_record"}},"created_at":"2026-05-18T01:02:12.485215+00:00","updated_at":"2026-05-18T01:02:12.485215+00:00"}