{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JVPXJBHI6CWAJO6MXDMKAPV225","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":"39ad3289c79aa24e78919ff31416cbe10799e1e47c0715fb72843e014fd11607","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-18T05:02:14Z","title_canon_sha256":"8fc92eb6a2d0bce0a59b55a19cd56ee6ddc7d4d2a699e539e22b3604929a6e20"},"schema_version":"1.0","source":{"id":"1301.4295","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4295","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4295v1","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4295","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"JVPXJBHI6CWA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JVPXJBHI6CWAJO6M","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JVPXJBHI","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:afee8fc4b3c6c2f4fd538998ca7352ea1ee30dc359231f3a63c8a955ecd15878","target":"graph","created_at":"2026-05-18T02:51:08Z","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":"For a vertex $x$ of a graph $G$, let $N_G[x]$ be the set of $x$ with all of its neighbors in $G$. A set $C$ of vertices is an {\\em identifying code} of $G$ if the sets $N_G[x]\\cap C$ are nonempty and distinct for all vertices $x$. If $G$ admits an identifying code, we say that $G$ is identifiable and denote by $\\gamma^{ID}(G)$ the minimum cardinality of an identifying code of $G$. In this paper, we study the identifying code of the corona product $H\\odot G$ of graphs $H$ and $G$. We first give a necessary and sufficient condition for the identifiable corona product $H\\odot G$, and then express","authors_text":"Kaishun Wang, Min Feng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-18T05:02:14Z","title":"Identifying codes of corona product graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4295","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:e735fc762db708635fd53329e060215a83be46ff5eecc1f67f181189c350b84c","target":"record","created_at":"2026-05-18T02:51:08Z","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":"39ad3289c79aa24e78919ff31416cbe10799e1e47c0715fb72843e014fd11607","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-18T05:02:14Z","title_canon_sha256":"8fc92eb6a2d0bce0a59b55a19cd56ee6ddc7d4d2a699e539e22b3604929a6e20"},"schema_version":"1.0","source":{"id":"1301.4295","kind":"arxiv","version":1}},"canonical_sha256":"4d5f7484e8f0ac04bbccb8d8a03ebad76a5c13725d432c1d33dfb8537ec3d99e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d5f7484e8f0ac04bbccb8d8a03ebad76a5c13725d432c1d33dfb8537ec3d99e","first_computed_at":"2026-05-18T02:51:08.670308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:08.670308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4VR47Ui5V1SiW8XuEAbtpHA2AGqijyP1tvhIU1K02fae5DY+eSKFlIfIIJuZOIEvCWpIhK+5ioiqm31ecnuGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:08.670777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4295","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e735fc762db708635fd53329e060215a83be46ff5eecc1f67f181189c350b84c","sha256:afee8fc4b3c6c2f4fd538998ca7352ea1ee30dc359231f3a63c8a955ecd15878"],"state_sha256":"df502491398700b5181ca35cc07a6377be3ae50668bae759389e093da49bf40d"}