{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1995:OFGU24LHP3MYC3ZOQXOTJ4JAXO","short_pith_number":"pith:OFGU24LH","schema_version":"1.0","canonical_sha256":"714d4d71677ed9816f2e85dd34f120bbb11ce90bdcb31b70ec6bb32a7dac2491","source":{"kind":"arxiv","id":"math/9504213","version":1},"attestation_state":"computed","paper":{"title":"Path optimization and near-greedy analysis for graph partitioning: an empirical study","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Jonathan Berry, Mark Goldberg","submitted_at":"1995-04-13T00:00:00Z","abstract_excerpt":"This paper presents the results of an experimental study of graph partitioning. We describe a new heuristic technique, path optimization, and its application to two variations of graph partitioning: the max_cut problem and the min_quotient_cut problem. We present the results of computational comparisons between this technique and the Kernighan-Lin algorithm, the simulated annealing algorithm, the FLOW-lagorithm the multilevel algorithm, and teh recent 0.878-approximation algorithm. The experiments were conducted on two classes of graphs that have become standard for such tests: random and rand"},"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":"math/9504213","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1995-04-13T00:00:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"db1703f3ff6720847d5ba6613cbb41250c8eb9717940bf51a542617d944c0796","abstract_canon_sha256":"cfdcca82ef4667906c72267e38cd97b0714f2db525880fade5e18606d6bc0728"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:50.261421Z","signature_b64":"vzskWn4GTiwUEfaXSbz6AU+RCWPHtR3081nFLn38bxTrsQl7zCPPbwQ+Dh0mSjGm3onrBzQb7KTbZJSOYEHbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"714d4d71677ed9816f2e85dd34f120bbb11ce90bdcb31b70ec6bb32a7dac2491","last_reissued_at":"2026-05-18T01:05:50.260830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:50.260830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path optimization and near-greedy analysis for graph partitioning: an empirical study","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Jonathan Berry, Mark Goldberg","submitted_at":"1995-04-13T00:00:00Z","abstract_excerpt":"This paper presents the results of an experimental study of graph partitioning. We describe a new heuristic technique, path optimization, and its application to two variations of graph partitioning: the max_cut problem and the min_quotient_cut problem. We present the results of computational comparisons between this technique and the Kernighan-Lin algorithm, the simulated annealing algorithm, the FLOW-lagorithm the multilevel algorithm, and teh recent 0.878-approximation algorithm. The experiments were conducted on two classes of graphs that have become standard for such tests: random and rand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9504213","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/9504213","created_at":"2026-05-18T01:05:50.260905+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9504213v1","created_at":"2026-05-18T01:05:50.260905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9504213","created_at":"2026-05-18T01:05:50.260905+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFGU24LHP3MY","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFGU24LHP3MYC3ZO","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFGU24LH","created_at":"2026-05-18T12:25:47.700082+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/OFGU24LHP3MYC3ZOQXOTJ4JAXO","json":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO.json","graph_json":"https://pith.science/api/pith-number/OFGU24LHP3MYC3ZOQXOTJ4JAXO/graph.json","events_json":"https://pith.science/api/pith-number/OFGU24LHP3MYC3ZOQXOTJ4JAXO/events.json","paper":"https://pith.science/paper/OFGU24LH"},"agent_actions":{"view_html":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO","download_json":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO.json","view_paper":"https://pith.science/paper/OFGU24LH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9504213&json=true","fetch_graph":"https://pith.science/api/pith-number/OFGU24LHP3MYC3ZOQXOTJ4JAXO/graph.json","fetch_events":"https://pith.science/api/pith-number/OFGU24LHP3MYC3ZOQXOTJ4JAXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO/action/storage_attestation","attest_author":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO/action/author_attestation","sign_citation":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO/action/citation_signature","submit_replication":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO/action/replication_record"}},"created_at":"2026-05-18T01:05:50.260905+00:00","updated_at":"2026-05-18T01:05:50.260905+00:00"}