{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HEJKOYVVBQWN4FQFTX5XWG4KEA","short_pith_number":"pith:HEJKOYVV","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"},"canonical_sha256":"3912a762b50c2cde16059dfb7b1b8a2024ed7e8573d0e900e25309084570ef2f","source":{"kind":"arxiv","id":"1202.0671","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0671","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0671v2","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0671","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"HEJKOYVVBQWN","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HEJKOYVVBQWN4FQF","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HEJKOYVV","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HEJKOYVVBQWN4FQFTX5XWG4KEA","target":"record","payload":{"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"},"canonical_sha256":"3912a762b50c2cde16059dfb7b1b8a2024ed7e8573d0e900e25309084570ef2f","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"},"source_kind":"arxiv","source_id":"1202.0671","source_version":2,"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-18T03:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gwEaI5sEuiWLXLi4G1iAABdyN6OXITwJHVPGklmEeCLyiuNaPxDgxsk0Lqlq2FEeXuEyfEW6u2xKm/uvB7osCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:33:36.526599Z"},"content_sha256":"2496d32a34ca52fcfcc5a57e3a45cbe852bf5cc888ba95bc22dc810f88083ee1","schema_version":"1.0","event_id":"sha256:2496d32a34ca52fcfcc5a57e3a45cbe852bf5cc888ba95bc22dc810f88083ee1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HEJKOYVVBQWN4FQFTX5XWG4KEA","target":"graph","payload":{"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"},"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-18T03:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IT8pbsGA6l+ChV6J5kiPI7psrlUWs7StGPaTe5CwRiDKNP77Bwiv52cpjTHgxcz5tLPjSbUTvf5BnR7Xlw0jCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:33:36.527327Z"},"content_sha256":"458166fbcaca63a856bf76ed9bb464456d5db13ab668815e82c07f0d70ab26d6","schema_version":"1.0","event_id":"sha256:458166fbcaca63a856bf76ed9bb464456d5db13ab668815e82c07f0d70ab26d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA/bundle.json","state_url":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA/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-05-27T16:33:36Z","links":{"resolver":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA","bundle":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA/bundle.json","state":"https://pith.science/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEJKOYVVBQWN4FQFTX5XWG4KEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HEJKOYVVBQWN4FQFTX5XWG4KEA","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":"f1647413e65dce14f3db8d5b8be80070aa430f3d1f123b91ec901f0ee2a7c0e3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-03T11:54:21Z","title_canon_sha256":"f39642baeb141a59a316efd317660286784acfdcb0291bcc71bdbde78d22ff8f"},"schema_version":"1.0","source":{"id":"1202.0671","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0671","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0671v2","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0671","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"HEJKOYVVBQWN","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HEJKOYVVBQWN4FQF","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HEJKOYVV","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:458166fbcaca63a856bf76ed9bb464456d5db13ab668815e82c07f0d70ab26d6","target":"graph","created_at":"2026-05-18T03:42:44Z","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":"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","authors_text":"Ville Junnila","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-03T11:54:21Z","title":"New lower bound for 2-identifying code in the square grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0671","kind":"arxiv","version":2},"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:2496d32a34ca52fcfcc5a57e3a45cbe852bf5cc888ba95bc22dc810f88083ee1","target":"record","created_at":"2026-05-18T03:42:44Z","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":"f1647413e65dce14f3db8d5b8be80070aa430f3d1f123b91ec901f0ee2a7c0e3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-03T11:54:21Z","title_canon_sha256":"f39642baeb141a59a316efd317660286784acfdcb0291bcc71bdbde78d22ff8f"},"schema_version":"1.0","source":{"id":"1202.0671","kind":"arxiv","version":2}},"canonical_sha256":"3912a762b50c2cde16059dfb7b1b8a2024ed7e8573d0e900e25309084570ef2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3912a762b50c2cde16059dfb7b1b8a2024ed7e8573d0e900e25309084570ef2f","first_computed_at":"2026-05-18T03:42:44.583111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:44.583111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wKVoiteOi+vu2w+H/12oqNS2CuAFPpxlmtLK8jy3enIvtBOPlIleB52rHHh7ijqqwFJAYxc61q43T1nx78j4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:44.583753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0671","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2496d32a34ca52fcfcc5a57e3a45cbe852bf5cc888ba95bc22dc810f88083ee1","sha256:458166fbcaca63a856bf76ed9bb464456d5db13ab668815e82c07f0d70ab26d6"],"state_sha256":"37f7357764c0461cdadc88e24b152a09e77beed8bcdaa606d3acd15d7da1811c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nh+oqsCpck4PIUzPTdxV2lQyMSDraJ1mRFtBwS6azvDaDgx4df3LtUfiXS2vEhdLNTlE7SNaQw3eCknxrVO9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:33:36.530874Z","bundle_sha256":"ecf9ffac7f70083a081cf0a531d958664e1b8ccdb4a495e3dd21f7f372513f72"}}