{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JVPXJBHI6CWAJO6MXDMKAPV225","short_pith_number":"pith:JVPXJBHI","schema_version":"1.0","canonical_sha256":"4d5f7484e8f0ac04bbccb8d8a03ebad76a5c13725d432c1d33dfb8537ec3d99e","source":{"kind":"arxiv","id":"1301.4295","version":1},"attestation_state":"computed","paper":{"title":"Identifying codes of corona product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng","submitted_at":"2013-01-18T05:02:14Z","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"},"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":"1301.4295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-18T05:02:14Z","cross_cats_sorted":[],"title_canon_sha256":"8fc92eb6a2d0bce0a59b55a19cd56ee6ddc7d4d2a699e539e22b3604929a6e20","abstract_canon_sha256":"39ad3289c79aa24e78919ff31416cbe10799e1e47c0715fb72843e014fd11607"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:08.670777Z","signature_b64":"4VR47Ui5V1SiW8XuEAbtpHA2AGqijyP1tvhIU1K02fae5DY+eSKFlIfIIJuZOIEvCWpIhK+5ioiqm31ecnuGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d5f7484e8f0ac04bbccb8d8a03ebad76a5c13725d432c1d33dfb8537ec3d99e","last_reissued_at":"2026-05-18T02:51:08.670308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:08.670308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying codes of corona product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng","submitted_at":"2013-01-18T05:02:14Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4295","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":"1301.4295","created_at":"2026-05-18T02:51:08.670391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4295v1","created_at":"2026-05-18T02:51:08.670391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4295","created_at":"2026-05-18T02:51:08.670391+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVPXJBHI6CWA","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVPXJBHI6CWAJO6M","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVPXJBHI","created_at":"2026-05-18T12:27:49.015174+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/JVPXJBHI6CWAJO6MXDMKAPV225","json":"https://pith.science/pith/JVPXJBHI6CWAJO6MXDMKAPV225.json","graph_json":"https://pith.science/api/pith-number/JVPXJBHI6CWAJO6MXDMKAPV225/graph.json","events_json":"https://pith.science/api/pith-number/JVPXJBHI6CWAJO6MXDMKAPV225/events.json","paper":"https://pith.science/paper/JVPXJBHI"},"agent_actions":{"view_html":"https://pith.science/pith/JVPXJBHI6CWAJO6MXDMKAPV225","download_json":"https://pith.science/pith/JVPXJBHI6CWAJO6MXDMKAPV225.json","view_paper":"https://pith.science/paper/JVPXJBHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4295&json=true","fetch_graph":"https://pith.science/api/pith-number/JVPXJBHI6CWAJO6MXDMKAPV225/graph.json","fetch_events":"https://pith.science/api/pith-number/JVPXJBHI6CWAJO6MXDMKAPV225/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVPXJBHI6CWAJO6MXDMKAPV225/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVPXJBHI6CWAJO6MXDMKAPV225/action/storage_attestation","attest_author":"https://pith.science/pith/JVPXJBHI6CWAJO6MXDMKAPV225/action/author_attestation","sign_citation":"https://pith.science/pith/JVPXJBHI6CWAJO6MXDMKAPV225/action/citation_signature","submit_replication":"https://pith.science/pith/JVPXJBHI6CWAJO6MXDMKAPV225/action/replication_record"}},"created_at":"2026-05-18T02:51:08.670391+00:00","updated_at":"2026-05-18T02:51:08.670391+00:00"}