{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XLROFIE6UGT5UTDORM5OGDOIEK","short_pith_number":"pith:XLROFIE6","canonical_record":{"source":{"id":"1302.4587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-19T12:13:10Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"465a8d25446ed0aa596c84f6574652d040700224fe78785825cd94ddd72ce7ec","abstract_canon_sha256":"d56a22d85af60726fa37911d61c7ef6b1ac2f51846f9ec9af5d8e79de9f4654d"},"schema_version":"1.0"},"canonical_sha256":"bae2e2a09ea1a7da4c6e8b3ae30dc822b3d2b38d8791201453012478926e80ca","source":{"kind":"arxiv","id":"1302.4587","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4587","created_at":"2026-05-18T03:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4587v2","created_at":"2026-05-18T03:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4587","created_at":"2026-05-18T03:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"XLROFIE6UGT5","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XLROFIE6UGT5UTDO","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XLROFIE6","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XLROFIE6UGT5UTDORM5OGDOIEK","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-19T12:13:10Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"465a8d25446ed0aa596c84f6574652d040700224fe78785825cd94ddd72ce7ec","abstract_canon_sha256":"d56a22d85af60726fa37911d61c7ef6b1ac2f51846f9ec9af5d8e79de9f4654d"},"schema_version":"1.0"},"canonical_sha256":"bae2e2a09ea1a7da4c6e8b3ae30dc822b3d2b38d8791201453012478926e80ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:26.482375Z","signature_b64":"1RmFzjE9VdVelM9ND6UYbLBComcOWT6YZLN+55EaNptLXYYxlYnvZkayliAvY0aQwzkRY0x3H2JJR2iD6NepBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bae2e2a09ea1a7da4c6e8b3ae30dc822b3d2b38d8791201453012478926e80ca","last_reissued_at":"2026-05-18T03:00:26.481651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:26.481651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4587","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-05-18T03:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80BEPrD30FP7bZ8ywq8JT00ebGXqk08gz4dJwlHuUaJCAKfdLJfDBmCyon6rFX2ShJ3F1j9/NkrWq8djweZ0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:31:14.849915Z"},"content_sha256":"b5277a70dba6f664e42331c920b1e52b56bf208511c580233365e9de3682cc13","schema_version":"1.0","event_id":"sha256:b5277a70dba6f664e42331c920b1e52b56bf208511c580233365e9de3682cc13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XLROFIE6UGT5UTDORM5OGDOIEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Parallel and External Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Marcel Birn, Nodari Sitchinava, Peter Sanders, Vitaly Osipov","submitted_at":"2013-02-19T12:13:10Z","abstract_excerpt":"We show that a simple algorithm for computing a matching on a graph runs in a logarithmic number of phases incurring work linear in the input size. The algorithm can be adapted to provide efficient algorithms in several models of computation, such as PRAM, External Memory, MapReduce and distributed memory models. Our CREW PRAM algorithm is the first O(log^2 n) time, linear work algorithm. Our experimental results indicate the algorithm's high speed and efficiency combined with good solution quality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4587","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":""},"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-18T03:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6P5riJuqPLfd/lzlbZ16pPT/MSiYs4hVy69cvcD7Z6+n5UNH9UMuCqEbkI/YYSY2U27J3Njwj/eSJHSwofqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:31:14.850313Z"},"content_sha256":"2fe4a2d66276921ad92fbc75148c31d4b84d7ac5f88b2cfbad130b6784b031d6","schema_version":"1.0","event_id":"sha256:2fe4a2d66276921ad92fbc75148c31d4b84d7ac5f88b2cfbad130b6784b031d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLROFIE6UGT5UTDORM5OGDOIEK/bundle.json","state_url":"https://pith.science/pith/XLROFIE6UGT5UTDORM5OGDOIEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLROFIE6UGT5UTDORM5OGDOIEK/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-30T21:31:14Z","links":{"resolver":"https://pith.science/pith/XLROFIE6UGT5UTDORM5OGDOIEK","bundle":"https://pith.science/pith/XLROFIE6UGT5UTDORM5OGDOIEK/bundle.json","state":"https://pith.science/pith/XLROFIE6UGT5UTDORM5OGDOIEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLROFIE6UGT5UTDORM5OGDOIEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XLROFIE6UGT5UTDORM5OGDOIEK","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":"d56a22d85af60726fa37911d61c7ef6b1ac2f51846f9ec9af5d8e79de9f4654d","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-19T12:13:10Z","title_canon_sha256":"465a8d25446ed0aa596c84f6574652d040700224fe78785825cd94ddd72ce7ec"},"schema_version":"1.0","source":{"id":"1302.4587","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4587","created_at":"2026-05-18T03:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4587v2","created_at":"2026-05-18T03:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4587","created_at":"2026-05-18T03:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"XLROFIE6UGT5","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XLROFIE6UGT5UTDO","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XLROFIE6","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:2fe4a2d66276921ad92fbc75148c31d4b84d7ac5f88b2cfbad130b6784b031d6","target":"graph","created_at":"2026-05-18T03:00:26Z","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":"We show that a simple algorithm for computing a matching on a graph runs in a logarithmic number of phases incurring work linear in the input size. The algorithm can be adapted to provide efficient algorithms in several models of computation, such as PRAM, External Memory, MapReduce and distributed memory models. Our CREW PRAM algorithm is the first O(log^2 n) time, linear work algorithm. Our experimental results indicate the algorithm's high speed and efficiency combined with good solution quality.","authors_text":"Christian Schulz, Marcel Birn, Nodari Sitchinava, Peter Sanders, Vitaly Osipov","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-19T12:13:10Z","title":"Efficient Parallel and External Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4587","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:b5277a70dba6f664e42331c920b1e52b56bf208511c580233365e9de3682cc13","target":"record","created_at":"2026-05-18T03:00:26Z","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":"d56a22d85af60726fa37911d61c7ef6b1ac2f51846f9ec9af5d8e79de9f4654d","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-19T12:13:10Z","title_canon_sha256":"465a8d25446ed0aa596c84f6574652d040700224fe78785825cd94ddd72ce7ec"},"schema_version":"1.0","source":{"id":"1302.4587","kind":"arxiv","version":2}},"canonical_sha256":"bae2e2a09ea1a7da4c6e8b3ae30dc822b3d2b38d8791201453012478926e80ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bae2e2a09ea1a7da4c6e8b3ae30dc822b3d2b38d8791201453012478926e80ca","first_computed_at":"2026-05-18T03:00:26.481651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:26.481651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1RmFzjE9VdVelM9ND6UYbLBComcOWT6YZLN+55EaNptLXYYxlYnvZkayliAvY0aQwzkRY0x3H2JJR2iD6NepBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:26.482375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4587","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5277a70dba6f664e42331c920b1e52b56bf208511c580233365e9de3682cc13","sha256:2fe4a2d66276921ad92fbc75148c31d4b84d7ac5f88b2cfbad130b6784b031d6"],"state_sha256":"8635024533550f248b3bd40e25a3aab6ebf60705d556dd3b704e54d496e5841a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0znpBTCA0aFARkQuYNBck90U0sfwXSk4JJwjRojqajMxeMpuNKzTigXA2KcpNFVUEmPM0unLb+/9etsBvzuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:31:14.852595Z","bundle_sha256":"91bf86e102fd16f5065bb5b7336b3254aaf62f7ef5412290055393fa55830f93"}}