{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QXGR2KE56EVWX7AUJGL2VY6FL7","short_pith_number":"pith:QXGR2KE5","canonical_record":{"source":{"id":"1809.09939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-26T12:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"bb65e8ffc1de70545ea41e3ac576e474da7815e3259ceb530eb0b22ad9c871f5","abstract_canon_sha256":"2a66d1aa5a95061e7d242e3bdf94c072c6e2c006529baeceef9b6a4f6c9aa42c"},"schema_version":"1.0"},"canonical_sha256":"85cd1d289df12b6bfc144997aae3c55fd0b5ad39c6b95c03c69f913a76984e09","source":{"kind":"arxiv","id":"1809.09939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09939","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09939v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09939","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"QXGR2KE56EVW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QXGR2KE56EVWX7AU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QXGR2KE5","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QXGR2KE56EVWX7AUJGL2VY6FL7","target":"record","payload":{"canonical_record":{"source":{"id":"1809.09939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-26T12:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"bb65e8ffc1de70545ea41e3ac576e474da7815e3259ceb530eb0b22ad9c871f5","abstract_canon_sha256":"2a66d1aa5a95061e7d242e3bdf94c072c6e2c006529baeceef9b6a4f6c9aa42c"},"schema_version":"1.0"},"canonical_sha256":"85cd1d289df12b6bfc144997aae3c55fd0b5ad39c6b95c03c69f913a76984e09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:43.207779Z","signature_b64":"RKgML6p15L3oPHWjNcXe2VmXWcTU5e8dgbBUT7YDoDhJR4NuII3+T/Z7EzVRSYUrXwTDI++Bd2wU5EIP/AGnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85cd1d289df12b6bfc144997aae3c55fd0b5ad39c6b95c03c69f913a76984e09","last_reissued_at":"2026-05-18T00:04:43.207208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:43.207208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.09939","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rR6RF/O3kpyoFWbsuQiQJhtWzccUFegpNu6WfACZvi3yEjHCAKPtQR2gKgdtYgd4OnCQU1k4ipdESMDJHBs2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:28:57.313014Z"},"content_sha256":"da2dd1fc1184ca60fedf9d1de918f25a1aafa76fe68b584a5205fd51b051e55c","schema_version":"1.0","event_id":"sha256:da2dd1fc1184ca60fedf9d1de918f25a1aafa76fe68b584a5205fd51b051e55c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QXGR2KE56EVWX7AUJGL2VY6FL7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect weak modular product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danial Dervovic","submitted_at":"2018-09-26T12:35:39Z","abstract_excerpt":"In this paper we enumerate the necessary and sufficient conditions for the weak modular product of two simple graphs to be perfect. The weak modular product differs from the direct product by also encoding non-adjacencies of the factor graphs in its edges. This work is motivated by the following: a 1978 theorem of Kozen states that two graphs on $n$ vertices are isomorphic if and only if there is a clique of size $n$ in the weak modular product between the two graphs. Furthermore, a straightforward corollary of Kozen's theorem and Lov\\'{a}sz's sandwich theorem is if the weak modular product be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09939","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gmcyOPbwVSwIUnRncIpfdPxkqZpFhv/kVxJheyrm8ooBFgj985glYGumtX6rfzHS0BvZhfmmQZ3vlsvd+hkyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:28:57.313380Z"},"content_sha256":"36442f7ec893b9d2a07a65fd1129a4770ac076b49baedd927123a04ec11fd70d","schema_version":"1.0","event_id":"sha256:36442f7ec893b9d2a07a65fd1129a4770ac076b49baedd927123a04ec11fd70d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXGR2KE56EVWX7AUJGL2VY6FL7/bundle.json","state_url":"https://pith.science/pith/QXGR2KE56EVWX7AUJGL2VY6FL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXGR2KE56EVWX7AUJGL2VY6FL7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T10:28:57Z","links":{"resolver":"https://pith.science/pith/QXGR2KE56EVWX7AUJGL2VY6FL7","bundle":"https://pith.science/pith/QXGR2KE56EVWX7AUJGL2VY6FL7/bundle.json","state":"https://pith.science/pith/QXGR2KE56EVWX7AUJGL2VY6FL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXGR2KE56EVWX7AUJGL2VY6FL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QXGR2KE56EVWX7AUJGL2VY6FL7","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":"2a66d1aa5a95061e7d242e3bdf94c072c6e2c006529baeceef9b6a4f6c9aa42c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-26T12:35:39Z","title_canon_sha256":"bb65e8ffc1de70545ea41e3ac576e474da7815e3259ceb530eb0b22ad9c871f5"},"schema_version":"1.0","source":{"id":"1809.09939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09939","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09939v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09939","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"QXGR2KE56EVW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QXGR2KE56EVWX7AU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QXGR2KE5","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:36442f7ec893b9d2a07a65fd1129a4770ac076b49baedd927123a04ec11fd70d","target":"graph","created_at":"2026-05-18T00:04:43Z","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":"In this paper we enumerate the necessary and sufficient conditions for the weak modular product of two simple graphs to be perfect. The weak modular product differs from the direct product by also encoding non-adjacencies of the factor graphs in its edges. This work is motivated by the following: a 1978 theorem of Kozen states that two graphs on $n$ vertices are isomorphic if and only if there is a clique of size $n$ in the weak modular product between the two graphs. Furthermore, a straightforward corollary of Kozen's theorem and Lov\\'{a}sz's sandwich theorem is if the weak modular product be","authors_text":"Danial Dervovic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-26T12:35:39Z","title":"Perfect weak modular product graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09939","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:da2dd1fc1184ca60fedf9d1de918f25a1aafa76fe68b584a5205fd51b051e55c","target":"record","created_at":"2026-05-18T00:04:43Z","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":"2a66d1aa5a95061e7d242e3bdf94c072c6e2c006529baeceef9b6a4f6c9aa42c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-26T12:35:39Z","title_canon_sha256":"bb65e8ffc1de70545ea41e3ac576e474da7815e3259ceb530eb0b22ad9c871f5"},"schema_version":"1.0","source":{"id":"1809.09939","kind":"arxiv","version":1}},"canonical_sha256":"85cd1d289df12b6bfc144997aae3c55fd0b5ad39c6b95c03c69f913a76984e09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85cd1d289df12b6bfc144997aae3c55fd0b5ad39c6b95c03c69f913a76984e09","first_computed_at":"2026-05-18T00:04:43.207208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:43.207208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RKgML6p15L3oPHWjNcXe2VmXWcTU5e8dgbBUT7YDoDhJR4NuII3+T/Z7EzVRSYUrXwTDI++Bd2wU5EIP/AGnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:43.207779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da2dd1fc1184ca60fedf9d1de918f25a1aafa76fe68b584a5205fd51b051e55c","sha256:36442f7ec893b9d2a07a65fd1129a4770ac076b49baedd927123a04ec11fd70d"],"state_sha256":"15bed1bc282ff8c8f0eb275b6f59f6f54df928866352a3aa26ba58efcc42d9df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3qTR6kFQmGjuqrMKF9/zsSU1vvD65wU6mwXwel9HzocFBqog9e6xGHeydHOQa0e1VR5k0CMk2TQDw3KtSmeBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:28:57.315377Z","bundle_sha256":"cbb72a3661f7fcace0016521320445408c78b62dc3e91a92439caf44ee8b7356"}}