{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JUN24KNLR6GXPQ7WSXYSP73ALS","short_pith_number":"pith:JUN24KNL","schema_version":"1.0","canonical_sha256":"4d1bae29ab8f8d77c3f695f127ff605cbd1a067aef923890f7bfe5cb4a4663d0","source":{"kind":"arxiv","id":"1602.04089","version":1},"attestation_state":"computed","paper":{"title":"On minimum identifying codes in some Cartesian product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas F. Rall, Kirsti Wash","submitted_at":"2016-02-12T15:55:08Z","abstract_excerpt":"An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. The minimum cardinality of an identifying code, or ID code, in a graph $G$ is called the ID code number of $G$ and is denoted $\\gid(G)$. In this paper, we give upper and lower bounds for the ID code number of the prism of a graph, or $G\\Box K_2$. In particular, we show that $\\gid(G \\Box K_2) \\ge \\gid(G)$ and we show that this bound is sharp. We also give upper and lower bounds for the ID code number of grid graphs and a"},"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":"1602.04089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-12T15:55:08Z","cross_cats_sorted":[],"title_canon_sha256":"7c25ce58b126c3ce7dd76dce21989318a95d5e4f9ab4448879c736c062ba66c1","abstract_canon_sha256":"3fb827cd5b8fece87f8af6806e8f0dad92937531729f3434469465d402fe901b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:54.621107Z","signature_b64":"9eczC2DMkXyCTlibb2jj2LlScvSXU+iHk8ZnZz0kiqdHszsXP4ObkObUfrLZDkEtPEFZxW54s45TpyTbOm4tAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d1bae29ab8f8d77c3f695f127ff605cbd1a067aef923890f7bfe5cb4a4663d0","last_reissued_at":"2026-05-18T01:20:54.620611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:54.620611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On minimum identifying codes in some Cartesian product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas F. Rall, Kirsti Wash","submitted_at":"2016-02-12T15:55:08Z","abstract_excerpt":"An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. The minimum cardinality of an identifying code, or ID code, in a graph $G$ is called the ID code number of $G$ and is denoted $\\gid(G)$. In this paper, we give upper and lower bounds for the ID code number of the prism of a graph, or $G\\Box K_2$. In particular, we show that $\\gid(G \\Box K_2) \\ge \\gid(G)$ and we show that this bound is sharp. We also give upper and lower bounds for the ID code number of grid graphs and a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04089","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":"1602.04089","created_at":"2026-05-18T01:20:54.620683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04089v1","created_at":"2026-05-18T01:20:54.620683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04089","created_at":"2026-05-18T01:20:54.620683+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUN24KNLR6GX","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUN24KNLR6GXPQ7W","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUN24KNL","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/JUN24KNLR6GXPQ7WSXYSP73ALS","json":"https://pith.science/pith/JUN24KNLR6GXPQ7WSXYSP73ALS.json","graph_json":"https://pith.science/api/pith-number/JUN24KNLR6GXPQ7WSXYSP73ALS/graph.json","events_json":"https://pith.science/api/pith-number/JUN24KNLR6GXPQ7WSXYSP73ALS/events.json","paper":"https://pith.science/paper/JUN24KNL"},"agent_actions":{"view_html":"https://pith.science/pith/JUN24KNLR6GXPQ7WSXYSP73ALS","download_json":"https://pith.science/pith/JUN24KNLR6GXPQ7WSXYSP73ALS.json","view_paper":"https://pith.science/paper/JUN24KNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04089&json=true","fetch_graph":"https://pith.science/api/pith-number/JUN24KNLR6GXPQ7WSXYSP73ALS/graph.json","fetch_events":"https://pith.science/api/pith-number/JUN24KNLR6GXPQ7WSXYSP73ALS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUN24KNLR6GXPQ7WSXYSP73ALS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUN24KNLR6GXPQ7WSXYSP73ALS/action/storage_attestation","attest_author":"https://pith.science/pith/JUN24KNLR6GXPQ7WSXYSP73ALS/action/author_attestation","sign_citation":"https://pith.science/pith/JUN24KNLR6GXPQ7WSXYSP73ALS/action/citation_signature","submit_replication":"https://pith.science/pith/JUN24KNLR6GXPQ7WSXYSP73ALS/action/replication_record"}},"created_at":"2026-05-18T01:20:54.620683+00:00","updated_at":"2026-05-18T01:20:54.620683+00:00"}