{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:G7NSQBNDY7VKEQZS3K5MCMTGKJ","short_pith_number":"pith:G7NSQBND","canonical_record":{"source":{"id":"1502.00708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-03T02:13:29Z","cross_cats_sorted":[],"title_canon_sha256":"4464d88dabc14329e64510d309aa2b1f2a50de9a6ed303d9b5def341a94f7b53","abstract_canon_sha256":"755ce0e26df89d739e35d6e77e04e4a659eab495a181cd17bdeb35741fe87053"},"schema_version":"1.0"},"canonical_sha256":"37db2805a3c7eaa24332dabac13266527906c02b7c09f5f2c2d837c8aa78ccdc","source":{"kind":"arxiv","id":"1502.00708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00708","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00708v1","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00708","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"G7NSQBNDY7VK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G7NSQBNDY7VKEQZS","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G7NSQBND","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:G7NSQBNDY7VKEQZS3K5MCMTGKJ","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-03T02:13:29Z","cross_cats_sorted":[],"title_canon_sha256":"4464d88dabc14329e64510d309aa2b1f2a50de9a6ed303d9b5def341a94f7b53","abstract_canon_sha256":"755ce0e26df89d739e35d6e77e04e4a659eab495a181cd17bdeb35741fe87053"},"schema_version":"1.0"},"canonical_sha256":"37db2805a3c7eaa24332dabac13266527906c02b7c09f5f2c2d837c8aa78ccdc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:04.552881Z","signature_b64":"ho51DRV91MQCBuc+9YKj8eDjO+PrxxNwD6OEM/IaI4KZcEF13Hr/9nIQy1Uax/Q/4NUu/2f4CMdHBWsBcof7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37db2805a3c7eaa24332dabac13266527906c02b7c09f5f2c2d837c8aa78ccdc","last_reissued_at":"2026-05-18T02:28:04.552447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:04.552447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00708","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-18T02:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFQtbGWfvnKWUNIeiWXda/yeZFDl7y6FwUhltOSvDXhjS5hh1CN8Ieg8q7L3BVmjQKh9y8ioBUlejXf1q2LPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T19:01:24.926608Z"},"content_sha256":"02d601b35f852b621cdc27a30969b511783f539c03eb8eee6400df487b156cd2","schema_version":"1.0","event_id":"sha256:02d601b35f852b621cdc27a30969b511783f539c03eb8eee6400df487b156cd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:G7NSQBNDY7VKEQZS3K5MCMTGKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vizing's Conjecture for Almost All Pairs of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aziz Contractor, Elliot Krop","submitted_at":"2015-02-03T02:13:29Z","abstract_excerpt":"For any graph $G=(V,E)$, a subset $S\\subseteq V$ $dominates$ $G$ if all vertices are contained in the closed neighborhood of $S$, that is $N[S]=V$. The minimum cardinality over all such $S$ is called the domination number, written $\\gamma(G)$. In 1963, V.G. Vizing conjectured that $\\gamma(G \\square H) \\geq \\gamma(G)\\gamma(H)$ where $\\square$ stands for the Cartesian product of graphs. In this note, we prove that if $\\left|G\\right|\\geq \\gamma(G)\\gamma(H)$ and $\\left|H\\right|\\geq \\gamma(G)\\gamma(H)$, then the conjecture holds. This result quickly implies Vizing's conjecture for almost all pairs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00708","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-18T02:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUGrkmZ1iKebMS7fFRAzjTC5co2fx3a8xQtW8BJoFOczZZ3StXhK1Pu8vWWuJXpoNQikhCUVtycV+9qXin/rAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T19:01:24.926947Z"},"content_sha256":"aa65bac273a155e8b5b0730a580aed224232adc75fe82319a3ac15db237c5de6","schema_version":"1.0","event_id":"sha256:aa65bac273a155e8b5b0730a580aed224232adc75fe82319a3ac15db237c5de6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7NSQBNDY7VKEQZS3K5MCMTGKJ/bundle.json","state_url":"https://pith.science/pith/G7NSQBNDY7VKEQZS3K5MCMTGKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7NSQBNDY7VKEQZS3K5MCMTGKJ/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-07-01T19:01:24Z","links":{"resolver":"https://pith.science/pith/G7NSQBNDY7VKEQZS3K5MCMTGKJ","bundle":"https://pith.science/pith/G7NSQBNDY7VKEQZS3K5MCMTGKJ/bundle.json","state":"https://pith.science/pith/G7NSQBNDY7VKEQZS3K5MCMTGKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7NSQBNDY7VKEQZS3K5MCMTGKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G7NSQBNDY7VKEQZS3K5MCMTGKJ","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":"755ce0e26df89d739e35d6e77e04e4a659eab495a181cd17bdeb35741fe87053","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-03T02:13:29Z","title_canon_sha256":"4464d88dabc14329e64510d309aa2b1f2a50de9a6ed303d9b5def341a94f7b53"},"schema_version":"1.0","source":{"id":"1502.00708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00708","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00708v1","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00708","created_at":"2026-05-18T02:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"G7NSQBNDY7VK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G7NSQBNDY7VKEQZS","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G7NSQBND","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:aa65bac273a155e8b5b0730a580aed224232adc75fe82319a3ac15db237c5de6","target":"graph","created_at":"2026-05-18T02:28:04Z","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 any graph $G=(V,E)$, a subset $S\\subseteq V$ $dominates$ $G$ if all vertices are contained in the closed neighborhood of $S$, that is $N[S]=V$. The minimum cardinality over all such $S$ is called the domination number, written $\\gamma(G)$. In 1963, V.G. Vizing conjectured that $\\gamma(G \\square H) \\geq \\gamma(G)\\gamma(H)$ where $\\square$ stands for the Cartesian product of graphs. In this note, we prove that if $\\left|G\\right|\\geq \\gamma(G)\\gamma(H)$ and $\\left|H\\right|\\geq \\gamma(G)\\gamma(H)$, then the conjecture holds. This result quickly implies Vizing's conjecture for almost all pairs ","authors_text":"Aziz Contractor, Elliot Krop","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-03T02:13:29Z","title":"Vizing's Conjecture for Almost All Pairs of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00708","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:02d601b35f852b621cdc27a30969b511783f539c03eb8eee6400df487b156cd2","target":"record","created_at":"2026-05-18T02:28:04Z","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":"755ce0e26df89d739e35d6e77e04e4a659eab495a181cd17bdeb35741fe87053","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-03T02:13:29Z","title_canon_sha256":"4464d88dabc14329e64510d309aa2b1f2a50de9a6ed303d9b5def341a94f7b53"},"schema_version":"1.0","source":{"id":"1502.00708","kind":"arxiv","version":1}},"canonical_sha256":"37db2805a3c7eaa24332dabac13266527906c02b7c09f5f2c2d837c8aa78ccdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37db2805a3c7eaa24332dabac13266527906c02b7c09f5f2c2d837c8aa78ccdc","first_computed_at":"2026-05-18T02:28:04.552447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:04.552447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ho51DRV91MQCBuc+9YKj8eDjO+PrxxNwD6OEM/IaI4KZcEF13Hr/9nIQy1Uax/Q/4NUu/2f4CMdHBWsBcof7DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:04.552881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02d601b35f852b621cdc27a30969b511783f539c03eb8eee6400df487b156cd2","sha256:aa65bac273a155e8b5b0730a580aed224232adc75fe82319a3ac15db237c5de6"],"state_sha256":"02ea47f6b29eaf956a913855ae504cce3bc4995c6b4bc3041b9681ff944ade6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1reoi/MYmQj9VW+NaFSiQn/31nSSsh9HiZw3jzhRQEhOCUTLpIT9sRR2q3huaKfI8hWm+FubvhsXCTrIJizuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T19:01:24.928884Z","bundle_sha256":"06ae486266e8bdc2d74e5a580e6c6a4fd0954d335d18f4c77e8dbcb8a20c5aa6"}}