{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GVM4BJ2ZN6OQCCBTYDMXWOU2QB","short_pith_number":"pith:GVM4BJ2Z","schema_version":"1.0","canonical_sha256":"3559c0a7596f9d010833c0d97b3a9a8066785d7435c4b5c5c94c4f858d8245dc","source":{"kind":"arxiv","id":"1703.02444","version":4},"attestation_state":"computed","paper":{"title":"Volume computation for sparse boolean quadric relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daphne Skipper, Jon Lee","submitted_at":"2017-03-04T00:08:34Z","abstract_excerpt":"Motivated by understanding the quality of tractable convex relaxations of intractable polytopes, Ko et al. gave a closed-form expression for the volume of a standard relaxation $\\mathscr{Q}(G)$ of the boolean quadric polytope (also known as the (full) correlation polytope) $\\mathscr{P}(G)$ of the complete graph $G=K_n$. We extend this work to structured sparse graphs, giving: (i) an efficient algorithm for $vol(\\mathscr{Q}(G))$ when $G$ has bounded tree width, (ii) closed-form expressions (and asymptotic behaviors) for $vol(\\mathscr{Q}(G))$ for all stars, paths, and cycles, and (iii) a closed-"},"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":"1703.02444","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-04T00:08:34Z","cross_cats_sorted":[],"title_canon_sha256":"76d542ff323861aa4c4e492cbe257163d930e1339b6cca9963b1ba5550874c14","abstract_canon_sha256":"1e1fd816d7c31ece630d290cf9a3a60d6f8884b77f7a4b258f8e6abe538024ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:00.426714Z","signature_b64":"HnGm5aVbiJKCrgD5qkmOY7D0DOi+iG6WKDHd3YZfBOQCBMUnfWSwRjfBXcUeJOYztWV5Iuzvic/EFUTZuK8rCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3559c0a7596f9d010833c0d97b3a9a8066785d7435c4b5c5c94c4f858d8245dc","last_reissued_at":"2026-05-18T00:03:00.426022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:00.426022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Volume computation for sparse boolean quadric relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daphne Skipper, Jon Lee","submitted_at":"2017-03-04T00:08:34Z","abstract_excerpt":"Motivated by understanding the quality of tractable convex relaxations of intractable polytopes, Ko et al. gave a closed-form expression for the volume of a standard relaxation $\\mathscr{Q}(G)$ of the boolean quadric polytope (also known as the (full) correlation polytope) $\\mathscr{P}(G)$ of the complete graph $G=K_n$. We extend this work to structured sparse graphs, giving: (i) an efficient algorithm for $vol(\\mathscr{Q}(G))$ when $G$ has bounded tree width, (ii) closed-form expressions (and asymptotic behaviors) for $vol(\\mathscr{Q}(G))$ for all stars, paths, and cycles, and (iii) a closed-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02444","kind":"arxiv","version":4},"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":"1703.02444","created_at":"2026-05-18T00:03:00.426135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02444v4","created_at":"2026-05-18T00:03:00.426135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02444","created_at":"2026-05-18T00:03:00.426135+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVM4BJ2ZN6OQ","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVM4BJ2ZN6OQCCBT","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVM4BJ2Z","created_at":"2026-05-18T12:31:18.294218+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/GVM4BJ2ZN6OQCCBTYDMXWOU2QB","json":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB.json","graph_json":"https://pith.science/api/pith-number/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/graph.json","events_json":"https://pith.science/api/pith-number/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/events.json","paper":"https://pith.science/paper/GVM4BJ2Z"},"agent_actions":{"view_html":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB","download_json":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB.json","view_paper":"https://pith.science/paper/GVM4BJ2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02444&json=true","fetch_graph":"https://pith.science/api/pith-number/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/graph.json","fetch_events":"https://pith.science/api/pith-number/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/action/storage_attestation","attest_author":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/action/author_attestation","sign_citation":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/action/citation_signature","submit_replication":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/action/replication_record"}},"created_at":"2026-05-18T00:03:00.426135+00:00","updated_at":"2026-05-18T00:03:00.426135+00:00"}