{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GVM4BJ2ZN6OQCCBTYDMXWOU2QB","short_pith_number":"pith:GVM4BJ2Z","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"},"canonical_sha256":"3559c0a7596f9d010833c0d97b3a9a8066785d7435c4b5c5c94c4f858d8245dc","source":{"kind":"arxiv","id":"1703.02444","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02444","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02444v4","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02444","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"GVM4BJ2ZN6OQ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GVM4BJ2ZN6OQCCBT","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GVM4BJ2Z","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GVM4BJ2ZN6OQCCBTYDMXWOU2QB","target":"record","payload":{"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"},"canonical_sha256":"3559c0a7596f9d010833c0d97b3a9a8066785d7435c4b5c5c94c4f858d8245dc","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"},"source_kind":"arxiv","source_id":"1703.02444","source_version":4,"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:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vR63D6T259WlRQ3Zwim6gZGp31wl1lai3+Uy3AN/fBayMFbFywbcEuDx4nqo5huBoTL3Dtyitv5eMEtaYE3lBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:59:15.459212Z"},"content_sha256":"3a146506bd016be3bfe02db13a20c55558b1f62d7a31399afb206297e74a232e","schema_version":"1.0","event_id":"sha256:3a146506bd016be3bfe02db13a20c55558b1f62d7a31399afb206297e74a232e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GVM4BJ2ZN6OQCCBTYDMXWOU2QB","target":"graph","payload":{"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"},"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:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yJV5bqNQqxi9F8n1/uAkk5sTfdhRiI2OWFoQGx19JeIXdaupJLcOqIYP0IhavPxKDYkPaPcEhovaEwltaH4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:59:15.459867Z"},"content_sha256":"995bcf5a12d967bfe9a59e4df7ba27987661f3ba4cdbe51ba5be7ed4ca8b0020","schema_version":"1.0","event_id":"sha256:995bcf5a12d967bfe9a59e4df7ba27987661f3ba4cdbe51ba5be7ed4ca8b0020"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/bundle.json","state_url":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/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-06T15:59:15Z","links":{"resolver":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB","bundle":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/bundle.json","state":"https://pith.science/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVM4BJ2ZN6OQCCBTYDMXWOU2QB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GVM4BJ2ZN6OQCCBTYDMXWOU2QB","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":"1e1fd816d7c31ece630d290cf9a3a60d6f8884b77f7a4b258f8e6abe538024ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-04T00:08:34Z","title_canon_sha256":"76d542ff323861aa4c4e492cbe257163d930e1339b6cca9963b1ba5550874c14"},"schema_version":"1.0","source":{"id":"1703.02444","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02444","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02444v4","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02444","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"GVM4BJ2ZN6OQ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GVM4BJ2ZN6OQCCBT","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GVM4BJ2Z","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:995bcf5a12d967bfe9a59e4df7ba27987661f3ba4cdbe51ba5be7ed4ca8b0020","target":"graph","created_at":"2026-05-18T00:03:00Z","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":"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-","authors_text":"Daphne Skipper, Jon Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-04T00:08:34Z","title":"Volume computation for sparse boolean quadric relaxations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02444","kind":"arxiv","version":4},"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:3a146506bd016be3bfe02db13a20c55558b1f62d7a31399afb206297e74a232e","target":"record","created_at":"2026-05-18T00:03:00Z","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":"1e1fd816d7c31ece630d290cf9a3a60d6f8884b77f7a4b258f8e6abe538024ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-04T00:08:34Z","title_canon_sha256":"76d542ff323861aa4c4e492cbe257163d930e1339b6cca9963b1ba5550874c14"},"schema_version":"1.0","source":{"id":"1703.02444","kind":"arxiv","version":4}},"canonical_sha256":"3559c0a7596f9d010833c0d97b3a9a8066785d7435c4b5c5c94c4f858d8245dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3559c0a7596f9d010833c0d97b3a9a8066785d7435c4b5c5c94c4f858d8245dc","first_computed_at":"2026-05-18T00:03:00.426022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:00.426022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HnGm5aVbiJKCrgD5qkmOY7D0DOi+iG6WKDHd3YZfBOQCBMUnfWSwRjfBXcUeJOYztWV5Iuzvic/EFUTZuK8rCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:00.426714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02444","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a146506bd016be3bfe02db13a20c55558b1f62d7a31399afb206297e74a232e","sha256:995bcf5a12d967bfe9a59e4df7ba27987661f3ba4cdbe51ba5be7ed4ca8b0020"],"state_sha256":"2e4e3d9a4557aeff508afdc773fde5d359c7e809638dc2580bca3accfbb30790"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8nBKA96gq5j5ZEZAdJMODd/cp7470NNiEzEDSj3s+pDb+WxmaUHCeMXNcd7adLnKeAExcjlZrIMLG5Q76CwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:59:15.462934Z","bundle_sha256":"d7099e5dfc9907a40b72b9475ffbcdf02e91aa1d2901e02f707d0ebdac69a25b"}}