{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4OZUWTIY6S3LZSUAIPGZUJUTRO","short_pith_number":"pith:4OZUWTIY","schema_version":"1.0","canonical_sha256":"e3b34b4d18f4b6bcca8043cd9a26938badde109b9ef65171bdcd61e958ea01ad","source":{"kind":"arxiv","id":"1109.0707","version":2},"attestation_state":"computed","paper":{"title":"A brief, simple proof of Vizing's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elliot Krop","submitted_at":"2011-09-04T12:07:25Z","abstract_excerpt":"For any graph $G=(V,E)$, a subset $S\\subseteq V$ \\emph{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 the conjecture."},"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":"1109.0707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-04T12:07:25Z","cross_cats_sorted":[],"title_canon_sha256":"ce15ef8ca232faaf1adf06ca41c474fe79299bd33d526a2d2cbb567672d39566","abstract_canon_sha256":"95a634ef8cadbbb9643ddee2ec9694a57baeceaab37a2ff0458ebc40af0c3eb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:55.549294Z","signature_b64":"a8I4EZD3y/5ADsZwsAP3IShMCcQmXWp3IxRW7d/D1ClrUSCjOnJ3UbDMdIWKpBrpWoMKQ8XkVPiHHf6/kGDLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3b34b4d18f4b6bcca8043cd9a26938badde109b9ef65171bdcd61e958ea01ad","last_reissued_at":"2026-05-18T04:12:55.548824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:55.548824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A brief, simple proof of Vizing's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elliot Krop","submitted_at":"2011-09-04T12:07:25Z","abstract_excerpt":"For any graph $G=(V,E)$, a subset $S\\subseteq V$ \\emph{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 the conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0707","kind":"arxiv","version":2},"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":"1109.0707","created_at":"2026-05-18T04:12:55.548898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.0707v2","created_at":"2026-05-18T04:12:55.548898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0707","created_at":"2026-05-18T04:12:55.548898+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OZUWTIY6S3L","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OZUWTIY6S3LZSUA","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OZUWTIY","created_at":"2026-05-18T12:26:20.644004+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/4OZUWTIY6S3LZSUAIPGZUJUTRO","json":"https://pith.science/pith/4OZUWTIY6S3LZSUAIPGZUJUTRO.json","graph_json":"https://pith.science/api/pith-number/4OZUWTIY6S3LZSUAIPGZUJUTRO/graph.json","events_json":"https://pith.science/api/pith-number/4OZUWTIY6S3LZSUAIPGZUJUTRO/events.json","paper":"https://pith.science/paper/4OZUWTIY"},"agent_actions":{"view_html":"https://pith.science/pith/4OZUWTIY6S3LZSUAIPGZUJUTRO","download_json":"https://pith.science/pith/4OZUWTIY6S3LZSUAIPGZUJUTRO.json","view_paper":"https://pith.science/paper/4OZUWTIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.0707&json=true","fetch_graph":"https://pith.science/api/pith-number/4OZUWTIY6S3LZSUAIPGZUJUTRO/graph.json","fetch_events":"https://pith.science/api/pith-number/4OZUWTIY6S3LZSUAIPGZUJUTRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OZUWTIY6S3LZSUAIPGZUJUTRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OZUWTIY6S3LZSUAIPGZUJUTRO/action/storage_attestation","attest_author":"https://pith.science/pith/4OZUWTIY6S3LZSUAIPGZUJUTRO/action/author_attestation","sign_citation":"https://pith.science/pith/4OZUWTIY6S3LZSUAIPGZUJUTRO/action/citation_signature","submit_replication":"https://pith.science/pith/4OZUWTIY6S3LZSUAIPGZUJUTRO/action/replication_record"}},"created_at":"2026-05-18T04:12:55.548898+00:00","updated_at":"2026-05-18T04:12:55.548898+00:00"}