{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HEJKOYVVBQWN4FQFTX5XWG4KEA","short_pith_number":"pith:HEJKOYVV","schema_version":"1.0","canonical_sha256":"3912a762b50c2cde16059dfb7b1b8a2024ed7e8573d0e900e25309084570ef2f","source":{"kind":"arxiv","id":"1202.0671","version":2},"attestation_state":"computed","paper":{"title":"New lower bound for 2-identifying code in the square grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ville Junnila","submitted_at":"2012-02-03T11:54:21Z","abstract_excerpt":"An $r$-identifying code in a graph $G = (V,E)$ is a subset $C \\subseteq V$ such that for each $u \\in V$ the intersection of $C$ and the ball of radius $r$ centered at $u$ is nonempty and unique. Previously, $r$-identifying codes have been studied in various grids. In particular, it has been shown that there exists a 2-identifying code in the square grid with density $5/29 \\approx 0.172$ and that there are no 2-identifying codes with density smaller than $3/20 = 0.15$. Recently, the lower bound has been improved to $6/37 \\approx 0.162$ by Martin and Stanton (2010). In this paper, we further imp"},"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":"1202.0671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-03T11:54:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f39642baeb141a59a316efd317660286784acfdcb0291bcc71bdbde78d22ff8f","abstract_canon_sha256":"f1647413e65dce14f3db8d5b8be80070aa430f3d1f123b91ec901f0ee2a7c0e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:44.583753Z","signature_b64":"wKVoiteOi+vu2w+H/12oqNS2CuAFPpxlmtLK8jy3enIvtBOPlIleB52rHHh7ijqqwFJAYxc61q43T1nx78j4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3912a762b50c2cde16059dfb7b1b8a2024ed7e8573d0e900e25309084570ef2f","last_reissued_at":"2026-05-18T03:42:44.583111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:44.583111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New lower bound for 2-identifying code in the square grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ville Junnila","submitted_at":"2012-02-03T11:54:21Z","abstract_excerpt":"An $r$-identifying code in a graph $G = (V,E)$ is a subset $C \\subseteq V$ such that for each $u \\in V$ the intersection of $C$ and the ball of radius $r$ centered at $u$ is nonempty and unique. Previously, $r$-identifying codes have been studied in various grids. In particular, it has been shown that there exists a 2-identifying code in the square grid with density $5/29 \\approx 0.172$ and that there are no 2-identifying codes with density smaller than $3/20 = 0.15$. Recently, the lower bound has been improved to $6/37 \\approx 0.162$ by Martin and Stanton (2010). In this paper, we further imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0671","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":"1202.0671","created_at":"2026-05-18T03:42:44.583209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0671v2","created_at":"2026-05-18T03:42:44.583209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0671","created_at":"2026-05-18T03:42:44.583209+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEJKOYVVBQWN","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEJKOYVVBQWN4FQF","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEJKOYVV","created_at":"2026-05-18T12:27:09.501522+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/HEJKOYVVBQWN4FQFTX5XWG4KEA","json":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA.json","graph_json":"https://pith.science/api/pith-number/HEJKOYVVBQWN4FQFTX5XWG4KEA/graph.json","events_json":"https://pith.science/api/pith-number/HEJKOYVVBQWN4FQFTX5XWG4KEA/events.json","paper":"https://pith.science/paper/HEJKOYVV"},"agent_actions":{"view_html":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA","download_json":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA.json","view_paper":"https://pith.science/paper/HEJKOYVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0671&json=true","fetch_graph":"https://pith.science/api/pith-number/HEJKOYVVBQWN4FQFTX5XWG4KEA/graph.json","fetch_events":"https://pith.science/api/pith-number/HEJKOYVVBQWN4FQFTX5XWG4KEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA/action/storage_attestation","attest_author":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA/action/author_attestation","sign_citation":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA/action/citation_signature","submit_replication":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA/action/replication_record"}},"created_at":"2026-05-18T03:42:44.583209+00:00","updated_at":"2026-05-18T03:42:44.583209+00:00"}