{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JRAF66CVSN3O3Y2R5OZ5HKAJOJ","short_pith_number":"pith:JRAF66CV","canonical_record":{"source":{"id":"1504.03812","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-15T08:06:15Z","cross_cats_sorted":[],"title_canon_sha256":"64fb67b8d9da25cffdff0a4651df3eefc7635f689992b89afb08cb289dfa98dc","abstract_canon_sha256":"e19f8bd208d5d611e38bcc623cbbab577c59a792a8ddc91d1552144235b8acb0"},"schema_version":"1.0"},"canonical_sha256":"4c405f78559376ede351ebb3d3a809724a50df915a726b5b8b86c26655f21aad","source":{"kind":"arxiv","id":"1504.03812","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03812","created_at":"2026-05-18T00:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03812v3","created_at":"2026-05-18T00:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03812","created_at":"2026-05-18T00:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"JRAF66CVSN3O","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JRAF66CVSN3O3Y2R","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JRAF66CV","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JRAF66CVSN3O3Y2R5OZ5HKAJOJ","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03812","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-15T08:06:15Z","cross_cats_sorted":[],"title_canon_sha256":"64fb67b8d9da25cffdff0a4651df3eefc7635f689992b89afb08cb289dfa98dc","abstract_canon_sha256":"e19f8bd208d5d611e38bcc623cbbab577c59a792a8ddc91d1552144235b8acb0"},"schema_version":"1.0"},"canonical_sha256":"4c405f78559376ede351ebb3d3a809724a50df915a726b5b8b86c26655f21aad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:54.077862Z","signature_b64":"YZ7ojwlroBo1JLeN+fK2z5tRahccAqfMrUbfXN77QfPtyvUB9mgltgAb6KPshFbq8V/ZBzvlLSHFWiplI2+fBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c405f78559376ede351ebb3d3a809724a50df915a726b5b8b86c26655f21aad","last_reissued_at":"2026-05-18T00:29:54.077242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:54.077242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03812","source_version":3,"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:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8g0+Odoa1fx3JtKQSj8mVL8LEDkb9zh7zA47JsGs3qS8iF+c2x8N6wTZNabRb84U4RAMRxpAuL5jwKqIoh6UCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:18:44.198254Z"},"content_sha256":"4753937be52d56d59a90ff52ab2b0902583530e4116f6cbc3f9661ef0b6aa8ce","schema_version":"1.0","event_id":"sha256:4753937be52d56d59a90ff52ab2b0902583530e4116f6cbc3f9661ef0b6aa8ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JRAF66CVSN3O3Y2R5OZ5HKAJOJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Bisection with Pareto-Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ben Strasser, Michael Hamann","submitted_at":"2015-04-15T08:06:15Z","abstract_excerpt":"We introduce FlowCutter, a novel algorithm to compute a set of edge cuts or node separators that optimize cut size and balance in the Pareto-sense. Our core algorithm solves the balanced connected st-edge-cut problem, where two given nodes s and t must be separated by removing edges to obtain two connected parts. Using the core algorithm we build variants that compute node separators and are independent of s and t. Using the Pareto-set we can identify cuts with a particularly good trade-off between cut size and balance that can be used to compute contraction and minimum fill-in orders, which c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03812","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"},"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:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WUvfoCcPryRnDanB6V8Z/lVpiS+/ceRpiKppnQORO/FbYxozvSb+93BLrKyK5P8pHhb0JkF++YSStPThDCgADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:18:44.198646Z"},"content_sha256":"95b3a73dd75b23ed4ee73f4e3959869d8aab69bc79ca7c44d4f44e9dadbeb688","schema_version":"1.0","event_id":"sha256:95b3a73dd75b23ed4ee73f4e3959869d8aab69bc79ca7c44d4f44e9dadbeb688"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/bundle.json","state_url":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/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-30T14:18:44Z","links":{"resolver":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ","bundle":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/bundle.json","state":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JRAF66CVSN3O3Y2R5OZ5HKAJOJ","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":"e19f8bd208d5d611e38bcc623cbbab577c59a792a8ddc91d1552144235b8acb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-15T08:06:15Z","title_canon_sha256":"64fb67b8d9da25cffdff0a4651df3eefc7635f689992b89afb08cb289dfa98dc"},"schema_version":"1.0","source":{"id":"1504.03812","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03812","created_at":"2026-05-18T00:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03812v3","created_at":"2026-05-18T00:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03812","created_at":"2026-05-18T00:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"JRAF66CVSN3O","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JRAF66CVSN3O3Y2R","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JRAF66CV","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:95b3a73dd75b23ed4ee73f4e3959869d8aab69bc79ca7c44d4f44e9dadbeb688","target":"graph","created_at":"2026-05-18T00:29:54Z","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 introduce FlowCutter, a novel algorithm to compute a set of edge cuts or node separators that optimize cut size and balance in the Pareto-sense. Our core algorithm solves the balanced connected st-edge-cut problem, where two given nodes s and t must be separated by removing edges to obtain two connected parts. Using the core algorithm we build variants that compute node separators and are independent of s and t. Using the Pareto-set we can identify cuts with a particularly good trade-off between cut size and balance that can be used to compute contraction and minimum fill-in orders, which c","authors_text":"Ben Strasser, Michael Hamann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-15T08:06:15Z","title":"Graph Bisection with Pareto-Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03812","kind":"arxiv","version":3},"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:4753937be52d56d59a90ff52ab2b0902583530e4116f6cbc3f9661ef0b6aa8ce","target":"record","created_at":"2026-05-18T00:29:54Z","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":"e19f8bd208d5d611e38bcc623cbbab577c59a792a8ddc91d1552144235b8acb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-15T08:06:15Z","title_canon_sha256":"64fb67b8d9da25cffdff0a4651df3eefc7635f689992b89afb08cb289dfa98dc"},"schema_version":"1.0","source":{"id":"1504.03812","kind":"arxiv","version":3}},"canonical_sha256":"4c405f78559376ede351ebb3d3a809724a50df915a726b5b8b86c26655f21aad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c405f78559376ede351ebb3d3a809724a50df915a726b5b8b86c26655f21aad","first_computed_at":"2026-05-18T00:29:54.077242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:54.077242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YZ7ojwlroBo1JLeN+fK2z5tRahccAqfMrUbfXN77QfPtyvUB9mgltgAb6KPshFbq8V/ZBzvlLSHFWiplI2+fBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:54.077862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03812","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4753937be52d56d59a90ff52ab2b0902583530e4116f6cbc3f9661ef0b6aa8ce","sha256:95b3a73dd75b23ed4ee73f4e3959869d8aab69bc79ca7c44d4f44e9dadbeb688"],"state_sha256":"b6bbed196c817dc3d5cd0938c2a99047ca1cc998cdae6e7d3531fc57a573295b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PWVD70gcp/C72QqcBK8IsM0/Ov9uKwvJSzyq1o6QjKNR6T2kIgagNT95mgkxRR2iDJyBAt0iK9eR8VPcqUIQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:18:44.200622Z","bundle_sha256":"c8cb71c70feafd8e0ba30adc8a1b72aeaa3ad8f1af0461d31edec98a6b894809"}}