{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:F234C6FL2ALVBT2XQ4OR4TZ3UK","short_pith_number":"pith:F234C6FL","schema_version":"1.0","canonical_sha256":"2eb7c178abd01750cf57871d1e4f3ba2af19f1f708cf4162dffcc92d28a6e514","source":{"kind":"arxiv","id":"1901.10288","version":3},"attestation_state":"computed","paper":{"title":"An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SC","math.AC","math.AG","math.OC"],"primary_cat":"math.CO","authors_text":"Angelika Wiegele, Daniel Krenn, Elisabeth Gaar, Susan Margulies","submitted_at":"2019-01-29T13:52:23Z","abstract_excerpt":"Vizing's conjecture (open since 1968) relates the sizes of dominating sets in two graphs to the size of a dominating set in their Cartesian product graph. In this paper, we formulate Vizing's conjecture itself as a Positivstellensatz existence question. In particular, we encode the conjecture as an ideal/polynomial pair such that the polynomial is nonnegative if and only if the conjecture is true. We demonstrate how to use semidefinite optimization techniques to computationally obtain numeric sum-of-squares certificates, and then show how to transform these numeric certificates into symbolic c"},"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":"1901.10288","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-29T13:52:23Z","cross_cats_sorted":["cs.SC","math.AC","math.AG","math.OC"],"title_canon_sha256":"dc7ac15adb840cd926abe3a1936982190b7009dc84d7d069c88c3611c9a79432","abstract_canon_sha256":"08bcda20730693d555f08ffe2c4fdba19c7801fc6cb774109c09bf10d81e5c2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:02.041471Z","signature_b64":"EN9g3rDbg4+YPukVAH+LmORIQpgGnuTUeMEcVtKzUe7RDAqVmmcAuZTcs5uaIYVsGW0rn/77xYgZq+pxt+GUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eb7c178abd01750cf57871d1e4f3ba2af19f1f708cf4162dffcc92d28a6e514","last_reissued_at":"2026-05-17T23:47:02.040768Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:02.040768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SC","math.AC","math.AG","math.OC"],"primary_cat":"math.CO","authors_text":"Angelika Wiegele, Daniel Krenn, Elisabeth Gaar, Susan Margulies","submitted_at":"2019-01-29T13:52:23Z","abstract_excerpt":"Vizing's conjecture (open since 1968) relates the sizes of dominating sets in two graphs to the size of a dominating set in their Cartesian product graph. In this paper, we formulate Vizing's conjecture itself as a Positivstellensatz existence question. In particular, we encode the conjecture as an ideal/polynomial pair such that the polynomial is nonnegative if and only if the conjecture is true. We demonstrate how to use semidefinite optimization techniques to computationally obtain numeric sum-of-squares certificates, and then show how to transform these numeric certificates into symbolic c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10288","kind":"arxiv","version":3},"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":"1901.10288","created_at":"2026-05-17T23:47:02.040875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10288v3","created_at":"2026-05-17T23:47:02.040875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10288","created_at":"2026-05-17T23:47:02.040875+00:00"},{"alias_kind":"pith_short_12","alias_value":"F234C6FL2ALV","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"F234C6FL2ALVBT2X","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"F234C6FL","created_at":"2026-05-18T12:33:15.570797+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/F234C6FL2ALVBT2XQ4OR4TZ3UK","json":"https://pith.science/pith/F234C6FL2ALVBT2XQ4OR4TZ3UK.json","graph_json":"https://pith.science/api/pith-number/F234C6FL2ALVBT2XQ4OR4TZ3UK/graph.json","events_json":"https://pith.science/api/pith-number/F234C6FL2ALVBT2XQ4OR4TZ3UK/events.json","paper":"https://pith.science/paper/F234C6FL"},"agent_actions":{"view_html":"https://pith.science/pith/F234C6FL2ALVBT2XQ4OR4TZ3UK","download_json":"https://pith.science/pith/F234C6FL2ALVBT2XQ4OR4TZ3UK.json","view_paper":"https://pith.science/paper/F234C6FL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10288&json=true","fetch_graph":"https://pith.science/api/pith-number/F234C6FL2ALVBT2XQ4OR4TZ3UK/graph.json","fetch_events":"https://pith.science/api/pith-number/F234C6FL2ALVBT2XQ4OR4TZ3UK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F234C6FL2ALVBT2XQ4OR4TZ3UK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F234C6FL2ALVBT2XQ4OR4TZ3UK/action/storage_attestation","attest_author":"https://pith.science/pith/F234C6FL2ALVBT2XQ4OR4TZ3UK/action/author_attestation","sign_citation":"https://pith.science/pith/F234C6FL2ALVBT2XQ4OR4TZ3UK/action/citation_signature","submit_replication":"https://pith.science/pith/F234C6FL2ALVBT2XQ4OR4TZ3UK/action/replication_record"}},"created_at":"2026-05-17T23:47:02.040875+00:00","updated_at":"2026-05-17T23:47:02.040875+00:00"}