{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MSEWTUHTG4X4FET4GDJY5TR2IX","short_pith_number":"pith:MSEWTUHT","schema_version":"1.0","canonical_sha256":"648969d0f3372fc2927c30d38ece3a45ec7dc582ffdcc45f29ef77a567f5f891","source":{"kind":"arxiv","id":"1106.3607","version":1},"attestation_state":"computed","paper":{"title":"Identifying codes of lexicographic product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng, Min Xu","submitted_at":"2011-06-18T02:33:07Z","abstract_excerpt":"Gravier et al. investigated the identifying codes of Cartesian product of two graphs. In this paper we consider the identifying codes of lexicographic product G[H] of a connected graph G and an arbitrary graph H, and obtain the minimum cardinality of identifying codes of G[H] in terms of some parameters of G and H."},"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":"1106.3607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-18T02:33:07Z","cross_cats_sorted":[],"title_canon_sha256":"4f4b25039f681ba16486883c07fadc493fdbfd790c21b76b32f56ed0ba192d29","abstract_canon_sha256":"1c0b1ce059a695a9b434062f9a29de52a1f429e1153dae7f839d81bc48a0cc8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:15.690975Z","signature_b64":"UEPSFGIWKxJeeRSZzdy7aZr5VudT6o6tQvZZQjDdjHiVLGCuCU1DGfzIefnvEsli/CdH7rXsPS8SZtuguTNdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"648969d0f3372fc2927c30d38ece3a45ec7dc582ffdcc45f29ef77a567f5f891","last_reissued_at":"2026-05-18T03:04:15.690503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:15.690503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying codes of lexicographic product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng, Min Xu","submitted_at":"2011-06-18T02:33:07Z","abstract_excerpt":"Gravier et al. investigated the identifying codes of Cartesian product of two graphs. In this paper we consider the identifying codes of lexicographic product G[H] of a connected graph G and an arbitrary graph H, and obtain the minimum cardinality of identifying codes of G[H] in terms of some parameters of G and H."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3607","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":"1106.3607","created_at":"2026-05-18T03:04:15.690572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3607v1","created_at":"2026-05-18T03:04:15.690572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3607","created_at":"2026-05-18T03:04:15.690572+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSEWTUHTG4X4","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSEWTUHTG4X4FET4","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSEWTUHT","created_at":"2026-05-18T12:26:34.985390+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/MSEWTUHTG4X4FET4GDJY5TR2IX","json":"https://pith.science/pith/MSEWTUHTG4X4FET4GDJY5TR2IX.json","graph_json":"https://pith.science/api/pith-number/MSEWTUHTG4X4FET4GDJY5TR2IX/graph.json","events_json":"https://pith.science/api/pith-number/MSEWTUHTG4X4FET4GDJY5TR2IX/events.json","paper":"https://pith.science/paper/MSEWTUHT"},"agent_actions":{"view_html":"https://pith.science/pith/MSEWTUHTG4X4FET4GDJY5TR2IX","download_json":"https://pith.science/pith/MSEWTUHTG4X4FET4GDJY5TR2IX.json","view_paper":"https://pith.science/paper/MSEWTUHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3607&json=true","fetch_graph":"https://pith.science/api/pith-number/MSEWTUHTG4X4FET4GDJY5TR2IX/graph.json","fetch_events":"https://pith.science/api/pith-number/MSEWTUHTG4X4FET4GDJY5TR2IX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSEWTUHTG4X4FET4GDJY5TR2IX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSEWTUHTG4X4FET4GDJY5TR2IX/action/storage_attestation","attest_author":"https://pith.science/pith/MSEWTUHTG4X4FET4GDJY5TR2IX/action/author_attestation","sign_citation":"https://pith.science/pith/MSEWTUHTG4X4FET4GDJY5TR2IX/action/citation_signature","submit_replication":"https://pith.science/pith/MSEWTUHTG4X4FET4GDJY5TR2IX/action/replication_record"}},"created_at":"2026-05-18T03:04:15.690572+00:00","updated_at":"2026-05-18T03:04:15.690572+00:00"}