{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OMJP7IYP5SMSYRRWDBBFG2CZV5","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":"fbe901c03d3f6d2c8b3371371700b499ab14dd51f30afa688b7537636eecbc31","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-18T19:26:36Z","title_canon_sha256":"c0b444374d46d2911bdd92b54421d40607a81e052e6d7adb38c6fbfed17f0872"},"schema_version":"1.0","source":{"id":"1006.3779","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3779","created_at":"2026-05-18T04:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3779v1","created_at":"2026-05-18T04:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3779","created_at":"2026-05-18T04:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"OMJP7IYP5SMS","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OMJP7IYP5SMSYRRW","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OMJP7IYP","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:cda4d995282ed67c610fbf5d11eb14ff58372811af3f5da94d32d0582f23c8b2","target":"graph","created_at":"2026-05-18T04:11:18Z","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":"Given a graph $G$, an identifying code $C \\subseteq V(G)$ is a vertex set such that for any two distinct vertices $v_1,v_2\\in V(G)$, the sets $N[v_1]\\cap C$ and $N[v_2]\\cap C$ are distinct and nonempty (here $N[v]$ denotes a vertex $v$ and its neighbors). We study the case when $G$ is the infinite hexagonal grid $H$. Cohen et.al. constructed two identifying codes for $H$ with density $3/7$ and proved that any identifying code for $H$ must have density at least $16/39\\approx0.410256$. Both their upper and lower bounds were best known until now. Here we prove a lower bound of $12/29\\approx0.4137","authors_text":"Daniel W. Cranston, Gexin Yu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-18T19:26:36Z","title":"A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3779","kind":"arxiv","version":1},"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:a4e5b68a84ce099faf35064412e2eac977f2243640605d3a97319d05ba666163","target":"record","created_at":"2026-05-18T04:11:18Z","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":"fbe901c03d3f6d2c8b3371371700b499ab14dd51f30afa688b7537636eecbc31","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-18T19:26:36Z","title_canon_sha256":"c0b444374d46d2911bdd92b54421d40607a81e052e6d7adb38c6fbfed17f0872"},"schema_version":"1.0","source":{"id":"1006.3779","kind":"arxiv","version":1}},"canonical_sha256":"7312ffa30fec992c46361842536859af4b2fbc0411b7763be7a975ce595e12a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7312ffa30fec992c46361842536859af4b2fbc0411b7763be7a975ce595e12a8","first_computed_at":"2026-05-18T04:11:18.027817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:18.027817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rdiOsr9si0GCFWpcU07tVOMhDcwV5NcO7IPe01HnkB5/M5wudOw7j/Ir7OVoXlVhK4r4oMw0REoguX5HQwi/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:18.028421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.3779","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4e5b68a84ce099faf35064412e2eac977f2243640605d3a97319d05ba666163","sha256:cda4d995282ed67c610fbf5d11eb14ff58372811af3f5da94d32d0582f23c8b2"],"state_sha256":"443376172cd6d113657a01fb214c46dcdc24874a6a950595bc180e48824eed1b"}