{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OR6UHMJNJ4D3OPEWWJKZVBK4CN","short_pith_number":"pith:OR6UHMJN","canonical_record":{"source":{"id":"2202.09420","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2022-02-18T20:32:35Z","cross_cats_sorted":[],"title_canon_sha256":"1be1d7098ce730d6f07f704d75522481485e8eade07a5d064eb7731db6724c5d","abstract_canon_sha256":"baa34408617a2c44034887089c1646dc6d4871705c89912b294fec3637c4f0ed"},"schema_version":"1.0"},"canonical_sha256":"747d43b12d4f07b73c96b2559a855c13570e7731799ac041504377bd3eb2d5ba","source":{"kind":"arxiv","id":"2202.09420","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.09420","created_at":"2026-07-05T04:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"2202.09420v2","created_at":"2026-07-05T04:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.09420","created_at":"2026-07-05T04:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"OR6UHMJNJ4D3","created_at":"2026-07-05T04:16:00Z"},{"alias_kind":"pith_short_16","alias_value":"OR6UHMJNJ4D3OPEW","created_at":"2026-07-05T04:16:00Z"},{"alias_kind":"pith_short_8","alias_value":"OR6UHMJN","created_at":"2026-07-05T04:16:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OR6UHMJNJ4D3OPEWWJKZVBK4CN","target":"record","payload":{"canonical_record":{"source":{"id":"2202.09420","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2022-02-18T20:32:35Z","cross_cats_sorted":[],"title_canon_sha256":"1be1d7098ce730d6f07f704d75522481485e8eade07a5d064eb7731db6724c5d","abstract_canon_sha256":"baa34408617a2c44034887089c1646dc6d4871705c89912b294fec3637c4f0ed"},"schema_version":"1.0"},"canonical_sha256":"747d43b12d4f07b73c96b2559a855c13570e7731799ac041504377bd3eb2d5ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:00.385435Z","signature_b64":"Tim9bVd+JqiKMKh58El26cCZHPtZgUoXmHNUL34Go7PHsgkhu3hCsurRrqBoQ9b4PZfZVfs7AEMaVbBLLhG1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"747d43b12d4f07b73c96b2559a855c13570e7731799ac041504377bd3eb2d5ba","last_reissued_at":"2026-07-05T04:16:00.385001Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:00.385001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.09420","source_version":2,"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-07-05T04:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/x3eDZSsJwADMkYXcBYLco9SVTh3jQD2XQjmzBJyZ/EYdbPbpY5SnvVwkytrV/IUpWxXsoxhEf5qmLXZtmRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:39:34.854780Z"},"content_sha256":"755d08710a6493802f698213d0a8d961b43c25acfce645ac097ae93f47224a9c","schema_version":"1.0","event_id":"sha256:755d08710a6493802f698213d0a8d961b43c25acfce645ac097ae93f47224a9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OR6UHMJNJ4D3OPEWWJKZVBK4CN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning Dense Graphs with Hardware Accelerators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Hayato Ushijima-Mwesigwa, Ilya Safro, Indradeep Ghosh, Xiaoyuan Liu","submitted_at":"2022-02-18T20:32:35Z","abstract_excerpt":"Graph partitioning is a fundamental combinatorial optimization problem that attracts a lot of attention from theoreticians and practitioners due to its broad applications. From multilevel graph partitioning to more general-purpose optimization solvers such as Gurobi and CPLEX, a wide range of approaches have been developed. Limitations of these approaches are important to study in order to break the computational optimization barriers of this problem. As we approach the limits of Moore's law, there is now a need to explore ways of solving such problems with special-purpose hardware such as qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.09420","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.09420/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5ut/AxlqEFb2hI0UNJMwSPuc8lYXXSzc0AZ4GQfzyIrx6nU/eR8Ma2UKM58JRSALOmBrXwTgJBj3W5e9K+ICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:39:34.855404Z"},"content_sha256":"7063384933bbe5c0cfeea2c7595f040051d871c86cd6dfe56660757d54bbd675","schema_version":"1.0","event_id":"sha256:7063384933bbe5c0cfeea2c7595f040051d871c86cd6dfe56660757d54bbd675"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OR6UHMJNJ4D3OPEWWJKZVBK4CN/bundle.json","state_url":"https://pith.science/pith/OR6UHMJNJ4D3OPEWWJKZVBK4CN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OR6UHMJNJ4D3OPEWWJKZVBK4CN/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-07-07T04:39:34Z","links":{"resolver":"https://pith.science/pith/OR6UHMJNJ4D3OPEWWJKZVBK4CN","bundle":"https://pith.science/pith/OR6UHMJNJ4D3OPEWWJKZVBK4CN/bundle.json","state":"https://pith.science/pith/OR6UHMJNJ4D3OPEWWJKZVBK4CN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OR6UHMJNJ4D3OPEWWJKZVBK4CN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OR6UHMJNJ4D3OPEWWJKZVBK4CN","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":"baa34408617a2c44034887089c1646dc6d4871705c89912b294fec3637c4f0ed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2022-02-18T20:32:35Z","title_canon_sha256":"1be1d7098ce730d6f07f704d75522481485e8eade07a5d064eb7731db6724c5d"},"schema_version":"1.0","source":{"id":"2202.09420","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.09420","created_at":"2026-07-05T04:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"2202.09420v2","created_at":"2026-07-05T04:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.09420","created_at":"2026-07-05T04:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"OR6UHMJNJ4D3","created_at":"2026-07-05T04:16:00Z"},{"alias_kind":"pith_short_16","alias_value":"OR6UHMJNJ4D3OPEW","created_at":"2026-07-05T04:16:00Z"},{"alias_kind":"pith_short_8","alias_value":"OR6UHMJN","created_at":"2026-07-05T04:16:00Z"}],"graph_snapshots":[{"event_id":"sha256:7063384933bbe5c0cfeea2c7595f040051d871c86cd6dfe56660757d54bbd675","target":"graph","created_at":"2026-07-05T04:16:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.09420/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph partitioning is a fundamental combinatorial optimization problem that attracts a lot of attention from theoreticians and practitioners due to its broad applications. From multilevel graph partitioning to more general-purpose optimization solvers such as Gurobi and CPLEX, a wide range of approaches have been developed. Limitations of these approaches are important to study in order to break the computational optimization barriers of this problem. As we approach the limits of Moore's law, there is now a need to explore ways of solving such problems with special-purpose hardware such as qua","authors_text":"Hayato Ushijima-Mwesigwa, Ilya Safro, Indradeep Ghosh, Xiaoyuan Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2022-02-18T20:32:35Z","title":"Partitioning Dense Graphs with Hardware Accelerators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.09420","kind":"arxiv","version":2},"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:755d08710a6493802f698213d0a8d961b43c25acfce645ac097ae93f47224a9c","target":"record","created_at":"2026-07-05T04:16:00Z","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":"baa34408617a2c44034887089c1646dc6d4871705c89912b294fec3637c4f0ed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2022-02-18T20:32:35Z","title_canon_sha256":"1be1d7098ce730d6f07f704d75522481485e8eade07a5d064eb7731db6724c5d"},"schema_version":"1.0","source":{"id":"2202.09420","kind":"arxiv","version":2}},"canonical_sha256":"747d43b12d4f07b73c96b2559a855c13570e7731799ac041504377bd3eb2d5ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"747d43b12d4f07b73c96b2559a855c13570e7731799ac041504377bd3eb2d5ba","first_computed_at":"2026-07-05T04:16:00.385001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:16:00.385001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tim9bVd+JqiKMKh58El26cCZHPtZgUoXmHNUL34Go7PHsgkhu3hCsurRrqBoQ9b4PZfZVfs7AEMaVbBLLhG1Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:16:00.385435Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.09420","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:755d08710a6493802f698213d0a8d961b43c25acfce645ac097ae93f47224a9c","sha256:7063384933bbe5c0cfeea2c7595f040051d871c86cd6dfe56660757d54bbd675"],"state_sha256":"c750d5e091a21ae434e384a0d26edc249e0d10c2faf448fe2b07dc452c5696c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LxyFwRibzN6Uo7zBzDLGz90RQ5aYIuKBc1Bn4rWz4gxmngRQB+tapEGba+VFBVEILc1WX4StxVxhMKWOC25CAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:39:34.858710Z","bundle_sha256":"c78a6db8a205c78c6596be3a28cd705df98aa97393833dd7680f2d05d0c5cd8a"}}