{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MSEWTUHTG4X4FET4GDJY5TR2IX","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":"1c0b1ce059a695a9b434062f9a29de52a1f429e1153dae7f839d81bc48a0cc8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-18T02:33:07Z","title_canon_sha256":"4f4b25039f681ba16486883c07fadc493fdbfd790c21b76b32f56ed0ba192d29"},"schema_version":"1.0","source":{"id":"1106.3607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3607","created_at":"2026-05-18T03:04:15Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3607v1","created_at":"2026-05-18T03:04:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3607","created_at":"2026-05-18T03:04:15Z"},{"alias_kind":"pith_short_12","alias_value":"MSEWTUHTG4X4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MSEWTUHTG4X4FET4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MSEWTUHT","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:5eacd52a520a43eb9386a33e8f3af39524c80ca82964f9463c9b182aac4d2f1c","target":"graph","created_at":"2026-05-18T03:04:15Z","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":"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.","authors_text":"Kaishun Wang, Min Feng, Min Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-18T02:33:07Z","title":"Identifying codes of lexicographic product of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3607","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:809089a82d8d881bd16aa447dd4ac525b8e37063df94989723f4d8762c4d959c","target":"record","created_at":"2026-05-18T03:04:15Z","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":"1c0b1ce059a695a9b434062f9a29de52a1f429e1153dae7f839d81bc48a0cc8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-18T02:33:07Z","title_canon_sha256":"4f4b25039f681ba16486883c07fadc493fdbfd790c21b76b32f56ed0ba192d29"},"schema_version":"1.0","source":{"id":"1106.3607","kind":"arxiv","version":1}},"canonical_sha256":"648969d0f3372fc2927c30d38ece3a45ec7dc582ffdcc45f29ef77a567f5f891","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"648969d0f3372fc2927c30d38ece3a45ec7dc582ffdcc45f29ef77a567f5f891","first_computed_at":"2026-05-18T03:04:15.690503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:15.690503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UEPSFGIWKxJeeRSZzdy7aZr5VudT6o6tQvZZQjDdjHiVLGCuCU1DGfzIefnvEsli/CdH7rXsPS8SZtuguTNdBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:15.690975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:809089a82d8d881bd16aa447dd4ac525b8e37063df94989723f4d8762c4d959c","sha256:5eacd52a520a43eb9386a33e8f3af39524c80ca82964f9463c9b182aac4d2f1c"],"state_sha256":"bbb808d93907789b3417ccf06774a280e73046b0ee1d71ab506bd79d739ace4c"}