{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SPHSD7JZQF5HGCZNSHPZJVGLL3","short_pith_number":"pith:SPHSD7JZ","canonical_record":{"source":{"id":"1303.4312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-03-18T16:40:58Z","cross_cats_sorted":[],"title_canon_sha256":"8f156bfadb8eec6805d7420c0df66b846c07b9d6887bec2ed520ca30a38f2886","abstract_canon_sha256":"1fd7d1b37b606b423b081e87d05a860c3810f7e6a79dded4a5aac4c04f127740"},"schema_version":"1.0"},"canonical_sha256":"93cf21fd39817a730b2d91df94d4cb5efe698d8a10599e35b2b9112c2ce7c4b0","source":{"kind":"arxiv","id":"1303.4312","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4312","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4312v2","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4312","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"pith_short_12","alias_value":"SPHSD7JZQF5H","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SPHSD7JZQF5HGCZN","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SPHSD7JZ","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SPHSD7JZQF5HGCZNSHPZJVGLL3","target":"record","payload":{"canonical_record":{"source":{"id":"1303.4312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-03-18T16:40:58Z","cross_cats_sorted":[],"title_canon_sha256":"8f156bfadb8eec6805d7420c0df66b846c07b9d6887bec2ed520ca30a38f2886","abstract_canon_sha256":"1fd7d1b37b606b423b081e87d05a860c3810f7e6a79dded4a5aac4c04f127740"},"schema_version":"1.0"},"canonical_sha256":"93cf21fd39817a730b2d91df94d4cb5efe698d8a10599e35b2b9112c2ce7c4b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:23.570017Z","signature_b64":"WALDyUGdQvcIVLUD1ItoYBzht33fzy4V7FCDvH+/nBFMwvN0hp+CVrx6q8mygk6Dydt3XqRzLWgCDw7MVZhmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93cf21fd39817a730b2d91df94d4cb5efe698d8a10599e35b2b9112c2ce7c4b0","last_reissued_at":"2026-05-18T03:07:23.569565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:23.569565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.4312","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:07:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lmzUKcHHr/gmaQn/6Wmj9dMCc4GM8nt2Mbu+jzc1HoRUV899q9qymXX9f/AhMGhnw0ZFnfroTs/FN2IoyK9/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:42:20.785776Z"},"content_sha256":"c228b19a781d6a437f503dee347def750c3af4f9508e83e2571fa4043259a003","schema_version":"1.0","event_id":"sha256:c228b19a781d6a437f503dee347def750c3af4f9508e83e2571fa4043259a003"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SPHSD7JZQF5HGCZNSHPZJVGLL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfectly load-balanced, optimal, stable, parallel merge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Siebert, Jesper Larsson Tr\\\"aff","submitted_at":"2013-03-18T16:40:58Z","abstract_excerpt":"We present a simple, work-optimal and synchronization-free solution to the problem of stably merging in parallel two given, ordered arrays of m and n elements into an ordered array of m+n elements. The main contribution is a new, simple, fast and direct algorithm that determines, for any prefix of the stably merged output sequence, the exact prefixes of each of the two input sequences needed to produce this output prefix. More precisely, for any given index (rank) in the resulting, but not yet constructed output array representing an output prefix, the algorithm computes the indices (co-ranks)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4312","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:07:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZ7/ojNDAHLB0kN4N/F2jj7EHDxFMbeNeABN4toq/JBYtMV9FGp+fpfCmh8yiO2Ec0kDZwVRgrsVasX6IvjUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:42:20.786122Z"},"content_sha256":"22dd59f9a26218d21a2cb0d4c2634dd647bf320a657e8e41e57f90cb49ec94f8","schema_version":"1.0","event_id":"sha256:22dd59f9a26218d21a2cb0d4c2634dd647bf320a657e8e41e57f90cb49ec94f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPHSD7JZQF5HGCZNSHPZJVGLL3/bundle.json","state_url":"https://pith.science/pith/SPHSD7JZQF5HGCZNSHPZJVGLL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPHSD7JZQF5HGCZNSHPZJVGLL3/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-06-24T05:42:20Z","links":{"resolver":"https://pith.science/pith/SPHSD7JZQF5HGCZNSHPZJVGLL3","bundle":"https://pith.science/pith/SPHSD7JZQF5HGCZNSHPZJVGLL3/bundle.json","state":"https://pith.science/pith/SPHSD7JZQF5HGCZNSHPZJVGLL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPHSD7JZQF5HGCZNSHPZJVGLL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SPHSD7JZQF5HGCZNSHPZJVGLL3","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":"1fd7d1b37b606b423b081e87d05a860c3810f7e6a79dded4a5aac4c04f127740","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-03-18T16:40:58Z","title_canon_sha256":"8f156bfadb8eec6805d7420c0df66b846c07b9d6887bec2ed520ca30a38f2886"},"schema_version":"1.0","source":{"id":"1303.4312","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4312","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4312v2","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4312","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"pith_short_12","alias_value":"SPHSD7JZQF5H","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SPHSD7JZQF5HGCZN","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SPHSD7JZ","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:22dd59f9a26218d21a2cb0d4c2634dd647bf320a657e8e41e57f90cb49ec94f8","target":"graph","created_at":"2026-05-18T03:07:23Z","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 present a simple, work-optimal and synchronization-free solution to the problem of stably merging in parallel two given, ordered arrays of m and n elements into an ordered array of m+n elements. The main contribution is a new, simple, fast and direct algorithm that determines, for any prefix of the stably merged output sequence, the exact prefixes of each of the two input sequences needed to produce this output prefix. More precisely, for any given index (rank) in the resulting, but not yet constructed output array representing an output prefix, the algorithm computes the indices (co-ranks)","authors_text":"Christian Siebert, Jesper Larsson Tr\\\"aff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-03-18T16:40:58Z","title":"Perfectly load-balanced, optimal, stable, parallel merge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4312","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:c228b19a781d6a437f503dee347def750c3af4f9508e83e2571fa4043259a003","target":"record","created_at":"2026-05-18T03:07:23Z","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":"1fd7d1b37b606b423b081e87d05a860c3810f7e6a79dded4a5aac4c04f127740","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-03-18T16:40:58Z","title_canon_sha256":"8f156bfadb8eec6805d7420c0df66b846c07b9d6887bec2ed520ca30a38f2886"},"schema_version":"1.0","source":{"id":"1303.4312","kind":"arxiv","version":2}},"canonical_sha256":"93cf21fd39817a730b2d91df94d4cb5efe698d8a10599e35b2b9112c2ce7c4b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93cf21fd39817a730b2d91df94d4cb5efe698d8a10599e35b2b9112c2ce7c4b0","first_computed_at":"2026-05-18T03:07:23.569565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:23.569565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WALDyUGdQvcIVLUD1ItoYBzht33fzy4V7FCDvH+/nBFMwvN0hp+CVrx6q8mygk6Dydt3XqRzLWgCDw7MVZhmAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:23.570017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4312","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c228b19a781d6a437f503dee347def750c3af4f9508e83e2571fa4043259a003","sha256:22dd59f9a26218d21a2cb0d4c2634dd647bf320a657e8e41e57f90cb49ec94f8"],"state_sha256":"7da018b4bb9d8fcf430e22e056ed91930f814543763efc4a9bde8c9fc3405261"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cN0OiieT4dR7k4C32NifGAapb55fhh7jLG6dbZWQNwLC3T2ooL30BuMQFqWPjLgRCGPxE37GNOjInuHIunaNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:42:20.788081Z","bundle_sha256":"7fbe435fa9250c96a6c1bc2b02a8a4536f5647a95d80b07e63f86248f69f0ab6"}}