{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4LOG7KU5VMEEROUL2KPEBNNSYA","short_pith_number":"pith:4LOG7KU5","canonical_record":{"source":{"id":"1408.0948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-05T12:33:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"66ed22e002705fdaea6251a09a0ccda8dadc05f7b0d422f0fecbbe3ee4678c3b","abstract_canon_sha256":"672d2c76b0251b28d10767b9cc644e32dae1577c44dbd49bbb1ad05e1f743068"},"schema_version":"1.0"},"canonical_sha256":"e2dc6faa9dab0848ba8bd29e40b5b2c03fa3abdc3557592c0b64a7da4cccfd7d","source":{"kind":"arxiv","id":"1408.0948","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0948","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0948v2","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0948","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"4LOG7KU5VMEE","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4LOG7KU5VMEEROUL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4LOG7KU5","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4LOG7KU5VMEEROUL2KPEBNNSYA","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-05T12:33:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"66ed22e002705fdaea6251a09a0ccda8dadc05f7b0d422f0fecbbe3ee4678c3b","abstract_canon_sha256":"672d2c76b0251b28d10767b9cc644e32dae1577c44dbd49bbb1ad05e1f743068"},"schema_version":"1.0"},"canonical_sha256":"e2dc6faa9dab0848ba8bd29e40b5b2c03fa3abdc3557592c0b64a7da4cccfd7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:27.246076Z","signature_b64":"Nmo+q2tLOBR8ZBNlorlnG4GwVsMDmqZr+cnt2LN2rYwwSlb4LnJUTNnn2cmvvBghKmgUoO80gIxHXq+89uzPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2dc6faa9dab0848ba8bd29e40b5b2c03fa3abdc3557592c0b64a7da4cccfd7d","last_reissued_at":"2026-05-18T00:18:27.245507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:27.245507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0948","source_version":2,"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:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+FL5Ee5cfw81+lzZcXIsby6o+nXtUZ9xNH305vNQQkpIBtHE2w3Fcz+2W342dysAQZo2dnr1wq2qbQzWQnRhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:13:05.796267Z"},"content_sha256":"2e37cab46d93b0fbd6893e07e25b52eea2fb7f5da4aa1ec75d4697b6fe6e822c","schema_version":"1.0","event_id":"sha256:2e37cab46d93b0fbd6893e07e25b52eea2fb7f5da4aa1ec75d4697b6fe6e822c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4LOG7KU5VMEEROUL2KPEBNNSYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A special role of Boolean quadratic polytopes among other combinatorial polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Aleksandr Maksimenko","submitted_at":"2014-08-05T12:33:13Z","abstract_excerpt":"We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set, 3-assignment. For comparing two families of polytopes we use the following method. We say that a family $P$ is affinely reduced to a family $Q$ if for every polytope $p\\in P$ there exists $q\\in Q$ such that $p$ is affinely equivalent to $q$ or to a face of $q$, where $\\dim q = O((\\dim p)^k)$ for some constant $k$. Under this comparison the above-mentioned f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0948","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"},"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:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qgXaVcbtK+w3baxGpc/+Y5oACM8J4FrQE3K4oNWG2LsgUY52N955upW0gRIw/5Q6TF1XB6BgH+IdhFOx8S4nAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:13:05.796639Z"},"content_sha256":"8fd5c8d8749373a0705ac675dfbdd64cc17b15f9f8593889a5fddc236b462608","schema_version":"1.0","event_id":"sha256:8fd5c8d8749373a0705ac675dfbdd64cc17b15f9f8593889a5fddc236b462608"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LOG7KU5VMEEROUL2KPEBNNSYA/bundle.json","state_url":"https://pith.science/pith/4LOG7KU5VMEEROUL2KPEBNNSYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LOG7KU5VMEEROUL2KPEBNNSYA/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-05-28T02:13:05Z","links":{"resolver":"https://pith.science/pith/4LOG7KU5VMEEROUL2KPEBNNSYA","bundle":"https://pith.science/pith/4LOG7KU5VMEEROUL2KPEBNNSYA/bundle.json","state":"https://pith.science/pith/4LOG7KU5VMEEROUL2KPEBNNSYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LOG7KU5VMEEROUL2KPEBNNSYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4LOG7KU5VMEEROUL2KPEBNNSYA","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":"672d2c76b0251b28d10767b9cc644e32dae1577c44dbd49bbb1ad05e1f743068","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-05T12:33:13Z","title_canon_sha256":"66ed22e002705fdaea6251a09a0ccda8dadc05f7b0d422f0fecbbe3ee4678c3b"},"schema_version":"1.0","source":{"id":"1408.0948","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0948","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0948v2","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0948","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"4LOG7KU5VMEE","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4LOG7KU5VMEEROUL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4LOG7KU5","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:8fd5c8d8749373a0705ac675dfbdd64cc17b15f9f8593889a5fddc236b462608","target":"graph","created_at":"2026-05-18T00:18:27Z","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":"We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set, 3-assignment. For comparing two families of polytopes we use the following method. We say that a family $P$ is affinely reduced to a family $Q$ if for every polytope $p\\in P$ there exists $q\\in Q$ such that $p$ is affinely equivalent to $q$ or to a face of $q$, where $\\dim q = O((\\dim p)^k)$ for some constant $k$. Under this comparison the above-mentioned f","authors_text":"Aleksandr Maksimenko","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-05T12:33:13Z","title":"A special role of Boolean quadratic polytopes among other combinatorial polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0948","kind":"arxiv","version":2},"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:2e37cab46d93b0fbd6893e07e25b52eea2fb7f5da4aa1ec75d4697b6fe6e822c","target":"record","created_at":"2026-05-18T00:18:27Z","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":"672d2c76b0251b28d10767b9cc644e32dae1577c44dbd49bbb1ad05e1f743068","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-05T12:33:13Z","title_canon_sha256":"66ed22e002705fdaea6251a09a0ccda8dadc05f7b0d422f0fecbbe3ee4678c3b"},"schema_version":"1.0","source":{"id":"1408.0948","kind":"arxiv","version":2}},"canonical_sha256":"e2dc6faa9dab0848ba8bd29e40b5b2c03fa3abdc3557592c0b64a7da4cccfd7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2dc6faa9dab0848ba8bd29e40b5b2c03fa3abdc3557592c0b64a7da4cccfd7d","first_computed_at":"2026-05-18T00:18:27.245507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:27.245507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nmo+q2tLOBR8ZBNlorlnG4GwVsMDmqZr+cnt2LN2rYwwSlb4LnJUTNnn2cmvvBghKmgUoO80gIxHXq+89uzPCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:27.246076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0948","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e37cab46d93b0fbd6893e07e25b52eea2fb7f5da4aa1ec75d4697b6fe6e822c","sha256:8fd5c8d8749373a0705ac675dfbdd64cc17b15f9f8593889a5fddc236b462608"],"state_sha256":"0a67559dddb291c91f80df3deb9c69b13254f7552f3c4e062feacc8c16894ef7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aruUbiG6fphWhm18i9+nBn6xjsiBn4RKaIELLRR7Nacee+l3uDSpmpKHPq/nPNKME7btTI5C8yaFPwiFfbueAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:13:05.798712Z","bundle_sha256":"51b4153ce017b5afb2c9c63ed9107a33c4321a700a6ddb2c044babb334195632"}}