{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OV7VHDXJSEWZRUYPCT5C5PHIDO","short_pith_number":"pith:OV7VHDXJ","canonical_record":{"source":{"id":"1611.07382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-22T16:07:28Z","cross_cats_sorted":[],"title_canon_sha256":"1ffc8e72cf525bd43c84480ba3d27c44d73c766bfb414012279befb7b9e06059","abstract_canon_sha256":"cf725c67f88932bcbb4c4f52d07e8e86a7fc1634a1642a56037bb453747702c6"},"schema_version":"1.0"},"canonical_sha256":"757f538ee9912d98d30f14fa2ebce81b8b97e6c501e84c64dad1506184bff0ad","source":{"kind":"arxiv","id":"1611.07382","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07382","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07382v1","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07382","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"OV7VHDXJSEWZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OV7VHDXJSEWZRUYP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OV7VHDXJ","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OV7VHDXJSEWZRUYPCT5C5PHIDO","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-22T16:07:28Z","cross_cats_sorted":[],"title_canon_sha256":"1ffc8e72cf525bd43c84480ba3d27c44d73c766bfb414012279befb7b9e06059","abstract_canon_sha256":"cf725c67f88932bcbb4c4f52d07e8e86a7fc1634a1642a56037bb453747702c6"},"schema_version":"1.0"},"canonical_sha256":"757f538ee9912d98d30f14fa2ebce81b8b97e6c501e84c64dad1506184bff0ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:24.158667Z","signature_b64":"EWsVgbv4FZhLmsBaXyVZhupkaHuCBVC8vI1AktVIgzhdxFPynM1afFOUBOpXcbkPPOvaWqKKZ4rHtTtLUvtxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"757f538ee9912d98d30f14fa2ebce81b8b97e6c501e84c64dad1506184bff0ad","last_reissued_at":"2026-05-18T00:57:24.158007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:24.158007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07382","source_version":1,"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:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4KblI03ooQRVbrlogjKHuAvbuhCrJ8er693slEMCsKgD7PIwTAopfXgf6GzO4axh22I0kM5t0mLrUwYOmEeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:09:19.685953Z"},"content_sha256":"1f9fc187404c610c1b069326e8e6bb302bc98ecf83f4cb255fa92159edd4e618","schema_version":"1.0","event_id":"sha256:1f9fc187404c610c1b069326e8e6bb302bc98ecf83f4cb255fa92159edd4e618"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OV7VHDXJSEWZRUYPCT5C5PHIDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph bisection revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Renata Sotirov","submitted_at":"2016-11-22T16:07:28Z","abstract_excerpt":"The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation for the graph bisection problem with a matrix variable of order $n$ - the number of vertices of the graph - that is equivalent to the currently strongest semidefinite programming relaxation obtained by using vector lifting. The reduction in the size of the matrix variable enables us to impose additional valid inequalities to the relaxation in order to further "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07382","kind":"arxiv","version":1},"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:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYtr60VRbxfT33Sl7e8sW0tSAx64M8j4/PaNSfyW8ZR6AtmGPbCZ6DBVKKX1gjzJLdbrOEJIGFfeX0sVIGfMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:09:19.686287Z"},"content_sha256":"d1dd45bd23a2db0f5f46a58a147d13303a0af184e4e9d922230e8890242655da","schema_version":"1.0","event_id":"sha256:d1dd45bd23a2db0f5f46a58a147d13303a0af184e4e9d922230e8890242655da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OV7VHDXJSEWZRUYPCT5C5PHIDO/bundle.json","state_url":"https://pith.science/pith/OV7VHDXJSEWZRUYPCT5C5PHIDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OV7VHDXJSEWZRUYPCT5C5PHIDO/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-25T11:09:19Z","links":{"resolver":"https://pith.science/pith/OV7VHDXJSEWZRUYPCT5C5PHIDO","bundle":"https://pith.science/pith/OV7VHDXJSEWZRUYPCT5C5PHIDO/bundle.json","state":"https://pith.science/pith/OV7VHDXJSEWZRUYPCT5C5PHIDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OV7VHDXJSEWZRUYPCT5C5PHIDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OV7VHDXJSEWZRUYPCT5C5PHIDO","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":"cf725c67f88932bcbb4c4f52d07e8e86a7fc1634a1642a56037bb453747702c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-22T16:07:28Z","title_canon_sha256":"1ffc8e72cf525bd43c84480ba3d27c44d73c766bfb414012279befb7b9e06059"},"schema_version":"1.0","source":{"id":"1611.07382","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07382","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07382v1","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07382","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"OV7VHDXJSEWZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OV7VHDXJSEWZRUYP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OV7VHDXJ","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:d1dd45bd23a2db0f5f46a58a147d13303a0af184e4e9d922230e8890242655da","target":"graph","created_at":"2026-05-18T00:57:24Z","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":"The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation for the graph bisection problem with a matrix variable of order $n$ - the number of vertices of the graph - that is equivalent to the currently strongest semidefinite programming relaxation obtained by using vector lifting. The reduction in the size of the matrix variable enables us to impose additional valid inequalities to the relaxation in order to further ","authors_text":"Renata Sotirov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-22T16:07:28Z","title":"Graph bisection revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07382","kind":"arxiv","version":1},"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:1f9fc187404c610c1b069326e8e6bb302bc98ecf83f4cb255fa92159edd4e618","target":"record","created_at":"2026-05-18T00:57:24Z","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":"cf725c67f88932bcbb4c4f52d07e8e86a7fc1634a1642a56037bb453747702c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-22T16:07:28Z","title_canon_sha256":"1ffc8e72cf525bd43c84480ba3d27c44d73c766bfb414012279befb7b9e06059"},"schema_version":"1.0","source":{"id":"1611.07382","kind":"arxiv","version":1}},"canonical_sha256":"757f538ee9912d98d30f14fa2ebce81b8b97e6c501e84c64dad1506184bff0ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"757f538ee9912d98d30f14fa2ebce81b8b97e6c501e84c64dad1506184bff0ad","first_computed_at":"2026-05-18T00:57:24.158007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:24.158007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EWsVgbv4FZhLmsBaXyVZhupkaHuCBVC8vI1AktVIgzhdxFPynM1afFOUBOpXcbkPPOvaWqKKZ4rHtTtLUvtxDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:24.158667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07382","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f9fc187404c610c1b069326e8e6bb302bc98ecf83f4cb255fa92159edd4e618","sha256:d1dd45bd23a2db0f5f46a58a147d13303a0af184e4e9d922230e8890242655da"],"state_sha256":"dfcd6d3aa892fa084d0401ef1667dc1c20d5fa20571164d18a57fd1a3343b402"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVZ/xdj7ig1WDJ7Z+GuLGaGmzbl7d22bZNpMIPQdlwu2Qk6se2HTWlgAXjPGoSxBIP8RMpcjhdz04Xdwrkn4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:09:19.688174Z","bundle_sha256":"3265b263ae6d2bc5823caeab187f1191d0819c632cc1e65a979c8cb2b52c85d7"}}