{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RPHEUZIK4GUS5SAC3YAVEIENVY","short_pith_number":"pith:RPHEUZIK","canonical_record":{"source":{"id":"1801.09809","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-01-30T00:18:06Z","cross_cats_sorted":[],"title_canon_sha256":"2b46b963fe9c5d12b6dfd79721ab792560e9ca427876a628a75740ce11549d0d","abstract_canon_sha256":"5bb697ead6c51f7441bf94b63b6e57107e93d72e7f91b92f166a3e289c03f8c5"},"schema_version":"1.0"},"canonical_sha256":"8bce4a650ae1a92ec802de0152208dae16aeeac5a0441884ff1dc089d42b5b51","source":{"kind":"arxiv","id":"1801.09809","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09809","created_at":"2026-07-05T01:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09809v2","created_at":"2026-07-05T01:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09809","created_at":"2026-07-05T01:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"RPHEUZIK4GUS","created_at":"2026-07-05T01:32:54Z"},{"alias_kind":"pith_short_16","alias_value":"RPHEUZIK4GUS5SAC","created_at":"2026-07-05T01:32:54Z"},{"alias_kind":"pith_short_8","alias_value":"RPHEUZIK","created_at":"2026-07-05T01:32:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RPHEUZIK4GUS5SAC3YAVEIENVY","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09809","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-01-30T00:18:06Z","cross_cats_sorted":[],"title_canon_sha256":"2b46b963fe9c5d12b6dfd79721ab792560e9ca427876a628a75740ce11549d0d","abstract_canon_sha256":"5bb697ead6c51f7441bf94b63b6e57107e93d72e7f91b92f166a3e289c03f8c5"},"schema_version":"1.0"},"canonical_sha256":"8bce4a650ae1a92ec802de0152208dae16aeeac5a0441884ff1dc089d42b5b51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:32:54.920928Z","signature_b64":"u8D6J2kUSPrertDuSzl7Y+I01GEdqVeUNOQNaO0ITatnRLooIV4sCgGe5o2ILQQ3dNGKtRrxZGOJvV1hJlAjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bce4a650ae1a92ec802de0152208dae16aeeac5a0441884ff1dc089d42b5b51","last_reissued_at":"2026-07-05T01:32:54.920562Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:32:54.920562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09809","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-05T01:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o8Do3FZNT2pROgB2zFGBTKWAK2YoCh99NSRGzumRDlZ6UKnC8jQHelEyaNvzcCOMCpmXiVQV/aWO0de9nXEmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:42:08.507529Z"},"content_sha256":"c7cae83d7eb4e33292e06fe2bc7932eb7d56fa0881f9d96147a59572e5526484","schema_version":"1.0","event_id":"sha256:c7cae83d7eb4e33292e06fe2bc7932eb7d56fa0881f9d96147a59572e5526484"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RPHEUZIK4GUS5SAC3YAVEIENVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ariful Azad, Ayd{\\i}n Buluc, Johannes Langguth, Xiaoye S. Li, Xinliang Wang","submitted_at":"2018-01-30T00:18:06Z","abstract_excerpt":"We design and implement an efficient parallel algorithm for finding a perfect matching in a weighted bipartite graph such that weights on the edges of the matching are large. This problem differs from the maximum weight matching problem, for which scalable approximation algorithms are known. It is primarily motivated by finding good pivots in scalable sparse direct solvers before factorization. Due to the lack of scalable alternatives, distributed solvers use sequential implementations of maximum weight perfect matching algorithms, such as those available in MC64. To overcome this limitation, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09809","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/1801.09809/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-05T01:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9L+Z5JYht6RS4cowxHpaf1zPTwmgNFBGpwn1L5KBICI2L7BQoTrGiGL5BNLwwcQzO17sO6HQPGUKQ3Miwld8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:42:08.507907Z"},"content_sha256":"80173882fc2117ef05fa4aee5559f1659cd3e3f97aaaadd0b2b2c69b874324b7","schema_version":"1.0","event_id":"sha256:80173882fc2117ef05fa4aee5559f1659cd3e3f97aaaadd0b2b2c69b874324b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPHEUZIK4GUS5SAC3YAVEIENVY/bundle.json","state_url":"https://pith.science/pith/RPHEUZIK4GUS5SAC3YAVEIENVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPHEUZIK4GUS5SAC3YAVEIENVY/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-06T18:42:08Z","links":{"resolver":"https://pith.science/pith/RPHEUZIK4GUS5SAC3YAVEIENVY","bundle":"https://pith.science/pith/RPHEUZIK4GUS5SAC3YAVEIENVY/bundle.json","state":"https://pith.science/pith/RPHEUZIK4GUS5SAC3YAVEIENVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPHEUZIK4GUS5SAC3YAVEIENVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RPHEUZIK4GUS5SAC3YAVEIENVY","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":"5bb697ead6c51f7441bf94b63b6e57107e93d72e7f91b92f166a3e289c03f8c5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-01-30T00:18:06Z","title_canon_sha256":"2b46b963fe9c5d12b6dfd79721ab792560e9ca427876a628a75740ce11549d0d"},"schema_version":"1.0","source":{"id":"1801.09809","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09809","created_at":"2026-07-05T01:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09809v2","created_at":"2026-07-05T01:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09809","created_at":"2026-07-05T01:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"RPHEUZIK4GUS","created_at":"2026-07-05T01:32:54Z"},{"alias_kind":"pith_short_16","alias_value":"RPHEUZIK4GUS5SAC","created_at":"2026-07-05T01:32:54Z"},{"alias_kind":"pith_short_8","alias_value":"RPHEUZIK","created_at":"2026-07-05T01:32:54Z"}],"graph_snapshots":[{"event_id":"sha256:80173882fc2117ef05fa4aee5559f1659cd3e3f97aaaadd0b2b2c69b874324b7","target":"graph","created_at":"2026-07-05T01:32: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1801.09809/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We design and implement an efficient parallel algorithm for finding a perfect matching in a weighted bipartite graph such that weights on the edges of the matching are large. This problem differs from the maximum weight matching problem, for which scalable approximation algorithms are known. It is primarily motivated by finding good pivots in scalable sparse direct solvers before factorization. Due to the lack of scalable alternatives, distributed solvers use sequential implementations of maximum weight perfect matching algorithms, such as those available in MC64. To overcome this limitation, ","authors_text":"Ariful Azad, Ayd{\\i}n Buluc, Johannes Langguth, Xiaoye S. Li, Xinliang Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-01-30T00:18:06Z","title":"A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09809","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:c7cae83d7eb4e33292e06fe2bc7932eb7d56fa0881f9d96147a59572e5526484","target":"record","created_at":"2026-07-05T01:32: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":"5bb697ead6c51f7441bf94b63b6e57107e93d72e7f91b92f166a3e289c03f8c5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-01-30T00:18:06Z","title_canon_sha256":"2b46b963fe9c5d12b6dfd79721ab792560e9ca427876a628a75740ce11549d0d"},"schema_version":"1.0","source":{"id":"1801.09809","kind":"arxiv","version":2}},"canonical_sha256":"8bce4a650ae1a92ec802de0152208dae16aeeac5a0441884ff1dc089d42b5b51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bce4a650ae1a92ec802de0152208dae16aeeac5a0441884ff1dc089d42b5b51","first_computed_at":"2026-07-05T01:32:54.920562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:32:54.920562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u8D6J2kUSPrertDuSzl7Y+I01GEdqVeUNOQNaO0ITatnRLooIV4sCgGe5o2ILQQ3dNGKtRrxZGOJvV1hJlAjBw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:32:54.920928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09809","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7cae83d7eb4e33292e06fe2bc7932eb7d56fa0881f9d96147a59572e5526484","sha256:80173882fc2117ef05fa4aee5559f1659cd3e3f97aaaadd0b2b2c69b874324b7"],"state_sha256":"3a4526d0bdda9f193761abc3b57c61c08b7f3cd134e5606158d24dfcf08d40db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ptb43UZ3qE7C7iRiRA2xcOYRpGxeNsLKmeB2U907btBXzgw58lUIO61/kc65rbF21NmGT4AOC6vIeA801bQ4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:42:08.509838Z","bundle_sha256":"8e67d42c44eab6205212defa190e0e0d19c26c636e391f44706caae406de460a"}}