{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JRAF66CVSN3O3Y2R5OZ5HKAJOJ","short_pith_number":"pith:JRAF66CV","schema_version":"1.0","canonical_sha256":"4c405f78559376ede351ebb3d3a809724a50df915a726b5b8b86c26655f21aad","source":{"kind":"arxiv","id":"1504.03812","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.03812","created_at":"2026-05-18T00:29:54.077336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03812v3","created_at":"2026-05-18T00:29:54.077336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03812","created_at":"2026-05-18T00:29:54.077336+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRAF66CVSN3O","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRAF66CVSN3O3Y2R","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRAF66CV","created_at":"2026-05-18T12:29:27.538025+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/JRAF66CVSN3O3Y2R5OZ5HKAJOJ","json":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ.json","graph_json":"https://pith.science/api/pith-number/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/graph.json","events_json":"https://pith.science/api/pith-number/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/events.json","paper":"https://pith.science/paper/JRAF66CV"},"agent_actions":{"view_html":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ","download_json":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ.json","view_paper":"https://pith.science/paper/JRAF66CV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03812&json=true","fetch_graph":"https://pith.science/api/pith-number/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/action/storage_attestation","attest_author":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/action/author_attestation","sign_citation":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/action/citation_signature","submit_replication":"https://pith.science/pith/JRAF66CVSN3O3Y2R5OZ5HKAJOJ/action/replication_record"}},"created_at":"2026-05-18T00:29:54.077336+00:00","updated_at":"2026-05-18T00:29:54.077336+00:00"}