{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1995:OFGU24LHP3MYC3ZOQXOTJ4JAXO","short_pith_number":"pith:OFGU24LH","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"},"canonical_sha256":"714d4d71677ed9816f2e85dd34f120bbb11ce90bdcb31b70ec6bb32a7dac2491","source":{"kind":"arxiv","id":"math/9504213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9504213","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/9504213v1","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9504213","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"OFGU24LHP3MY","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"OFGU24LHP3MYC3ZO","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"OFGU24LH","created_at":"2026-05-18T12:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1995:OFGU24LHP3MYC3ZOQXOTJ4JAXO","target":"record","payload":{"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"},"canonical_sha256":"714d4d71677ed9816f2e85dd34f120bbb11ce90bdcb31b70ec6bb32a7dac2491","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"},"source_kind":"arxiv","source_id":"math/9504213","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-18T01:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uu4rA6XXZSYsF8lWJyjxQmivT84G9iCNN1BycA/g6hK7V6kpacAcy9I2Q4tC3TBl1i/nzqdJbuDaf8wzkgNwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:55:27.654686Z"},"content_sha256":"e81a7c79f3c79b46a2e9192de9e8752afdad8a212eb3992fc4a12e3c39ea2201","schema_version":"1.0","event_id":"sha256:e81a7c79f3c79b46a2e9192de9e8752afdad8a212eb3992fc4a12e3c39ea2201"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1995:OFGU24LHP3MYC3ZOQXOTJ4JAXO","target":"graph","payload":{"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"},"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-18T01:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SguopUH1AJpvz7q5a+D2XW8Drlls3g4rheLE37K5qxKgkZtJxDb5lMZfZ/GLqwRUeOrQuDEL9kFA7rgZSlrOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:55:27.655324Z"},"content_sha256":"1428f622438d8419a447ad9b3dc0684a004607b202f596e0db6e479498f1511a","schema_version":"1.0","event_id":"sha256:1428f622438d8419a447ad9b3dc0684a004607b202f596e0db6e479498f1511a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO/bundle.json","state_url":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO/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-28T14:55:27Z","links":{"resolver":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO","bundle":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO/bundle.json","state":"https://pith.science/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFGU24LHP3MYC3ZOQXOTJ4JAXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1995:OFGU24LHP3MYC3ZOQXOTJ4JAXO","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":"cfdcca82ef4667906c72267e38cd97b0714f2db525880fade5e18606d6bc0728","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"math.CO","submitted_at":"1995-04-13T00:00:00Z","title_canon_sha256":"db1703f3ff6720847d5ba6613cbb41250c8eb9717940bf51a542617d944c0796"},"schema_version":"1.0","source":{"id":"math/9504213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9504213","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/9504213v1","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9504213","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"OFGU24LHP3MY","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"OFGU24LHP3MYC3ZO","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"OFGU24LH","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:1428f622438d8419a447ad9b3dc0684a004607b202f596e0db6e479498f1511a","target":"graph","created_at":"2026-05-18T01:05:50Z","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":"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","authors_text":"Jonathan Berry, Mark Goldberg","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"1995-04-13T00:00:00Z","title":"Path optimization and near-greedy analysis for graph partitioning: an empirical study"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9504213","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:e81a7c79f3c79b46a2e9192de9e8752afdad8a212eb3992fc4a12e3c39ea2201","target":"record","created_at":"2026-05-18T01:05:50Z","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":"cfdcca82ef4667906c72267e38cd97b0714f2db525880fade5e18606d6bc0728","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"math.CO","submitted_at":"1995-04-13T00:00:00Z","title_canon_sha256":"db1703f3ff6720847d5ba6613cbb41250c8eb9717940bf51a542617d944c0796"},"schema_version":"1.0","source":{"id":"math/9504213","kind":"arxiv","version":1}},"canonical_sha256":"714d4d71677ed9816f2e85dd34f120bbb11ce90bdcb31b70ec6bb32a7dac2491","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"714d4d71677ed9816f2e85dd34f120bbb11ce90bdcb31b70ec6bb32a7dac2491","first_computed_at":"2026-05-18T01:05:50.260830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:50.260830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vzskWn4GTiwUEfaXSbz6AU+RCWPHtR3081nFLn38bxTrsQl7zCPPbwQ+Dh0mSjGm3onrBzQb7KTbZJSOYEHbBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:50.261421Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9504213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e81a7c79f3c79b46a2e9192de9e8752afdad8a212eb3992fc4a12e3c39ea2201","sha256:1428f622438d8419a447ad9b3dc0684a004607b202f596e0db6e479498f1511a"],"state_sha256":"a607175f10fe6a6cf5fd59a91a93b01b5803d2c7571ec2d2a8aef0ac2fce0b14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pfGkuaexK7/flIeDKQ9e9QglT+aZBjUqtCTw1nyoeHPjGC//Jn8loN+4YezEctAhWNjY888lwv0UKTPY7WZkDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:55:27.658576Z","bundle_sha256":"caa0ae7695ef0993a6423ceb73047a3c9c0736a09446d477e68bac34f625aa13"}}