{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:K3J4QKFI7HOKLS7RODTAEZL422","short_pith_number":"pith:K3J4QKFI","canonical_record":{"source":{"id":"1406.2628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-06-10T17:04:23Z","cross_cats_sorted":[],"title_canon_sha256":"bb466b227f1145262b0898ed63129e5a8cca01eafc047557f6c57f739d7b3152","abstract_canon_sha256":"cfccc42b98d675971e7685d5268d00aa6b222e6d829445f7f2474b0a5c93abb2"},"schema_version":"1.0"},"canonical_sha256":"56d3c828a8f9dca5cbf170e602657cd6be2901538c74c99e4058f829f6b5e1a2","source":{"kind":"arxiv","id":"1406.2628","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2628","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2628v2","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2628","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"K3J4QKFI7HOK","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"K3J4QKFI7HOKLS7R","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"K3J4QKFI","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:K3J4QKFI7HOKLS7RODTAEZL422","target":"record","payload":{"canonical_record":{"source":{"id":"1406.2628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-06-10T17:04:23Z","cross_cats_sorted":[],"title_canon_sha256":"bb466b227f1145262b0898ed63129e5a8cca01eafc047557f6c57f739d7b3152","abstract_canon_sha256":"cfccc42b98d675971e7685d5268d00aa6b222e6d829445f7f2474b0a5c93abb2"},"schema_version":"1.0"},"canonical_sha256":"56d3c828a8f9dca5cbf170e602657cd6be2901538c74c99e4058f829f6b5e1a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:19.778465Z","signature_b64":"RNlBxEE0f0urU6bslpni6/Dd6Myaj+5ej4CESzamk7K42P84pB9RQMj7GZDCX29v9g+nBILMfaIZ9XtEWZ0dCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56d3c828a8f9dca5cbf170e602657cd6be2901538c74c99e4058f829f6b5e1a2","last_reissued_at":"2026-05-18T02:49:19.777690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:19.777690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.2628","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-18T02:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2z3pnlZqU0uWGNi2VRgWgFJWCVMH6FLCU8kSFi35fYirPFPx9Lf7LbB6yNdLwjcY9W2foqnM+zy5XqumA4VAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:30:31.047194Z"},"content_sha256":"dac6d801a0129351f71080aeb3d0e1acae770e8a06bc6aef2a3138e89aead0c1","schema_version":"1.0","event_id":"sha256:dac6d801a0129351f71080aeb3d0e1acae770e8a06bc6aef2a3138e89aead0c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:K3J4QKFI7HOKLS7RODTAEZL422","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Merge Path - A Visually Intuitive Approach to Parallel Merging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Oded Green, Saher Odeh, Yitzhak Birk","submitted_at":"2014-06-10T17:04:23Z","abstract_excerpt":"Merging two sorted arrays is a prominent building block for sorting and other functions. Its efficient parallelization requires balancing the load among compute cores, minimizing the extra work brought about by parallelization, and minimizing inter-thread synchronization requirements. Efficient use of memory is also important.\n  We present a novel, visually intuitive approach to partitioning two input sorted arrays into pairs of contiguous sequences of elements, one from each array, such that 1) each pair comprises any desired total number of elements, and 2) the elements of each pair form a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2628","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-18T02:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7qzGAjJj2HeA84PBJZp5jA6OnLBMNuZQhHW7u4rBWScxij5DMjRBWlxwRw0b00cAH5WGykAZfzjfGuF7JuyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:30:31.047795Z"},"content_sha256":"704b988731e94a1f9b11dec0967ece48780889be9fe3aa1bb57c210d81c1bb22","schema_version":"1.0","event_id":"sha256:704b988731e94a1f9b11dec0967ece48780889be9fe3aa1bb57c210d81c1bb22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3J4QKFI7HOKLS7RODTAEZL422/bundle.json","state_url":"https://pith.science/pith/K3J4QKFI7HOKLS7RODTAEZL422/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3J4QKFI7HOKLS7RODTAEZL422/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-08-16T20:30:31Z","links":{"resolver":"https://pith.science/pith/K3J4QKFI7HOKLS7RODTAEZL422","bundle":"https://pith.science/pith/K3J4QKFI7HOKLS7RODTAEZL422/bundle.json","state":"https://pith.science/pith/K3J4QKFI7HOKLS7RODTAEZL422/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3J4QKFI7HOKLS7RODTAEZL422/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:K3J4QKFI7HOKLS7RODTAEZL422","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":"cfccc42b98d675971e7685d5268d00aa6b222e6d829445f7f2474b0a5c93abb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-06-10T17:04:23Z","title_canon_sha256":"bb466b227f1145262b0898ed63129e5a8cca01eafc047557f6c57f739d7b3152"},"schema_version":"1.0","source":{"id":"1406.2628","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2628","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2628v2","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2628","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"K3J4QKFI7HOK","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"K3J4QKFI7HOKLS7R","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"K3J4QKFI","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:704b988731e94a1f9b11dec0967ece48780889be9fe3aa1bb57c210d81c1bb22","target":"graph","created_at":"2026-05-18T02:49:19Z","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":"Merging two sorted arrays is a prominent building block for sorting and other functions. Its efficient parallelization requires balancing the load among compute cores, minimizing the extra work brought about by parallelization, and minimizing inter-thread synchronization requirements. Efficient use of memory is also important.\n  We present a novel, visually intuitive approach to partitioning two input sorted arrays into pairs of contiguous sequences of elements, one from each array, such that 1) each pair comprises any desired total number of elements, and 2) the elements of each pair form a c","authors_text":"Oded Green, Saher Odeh, Yitzhak Birk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-06-10T17:04:23Z","title":"Merge Path - A Visually Intuitive Approach to Parallel Merging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2628","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:dac6d801a0129351f71080aeb3d0e1acae770e8a06bc6aef2a3138e89aead0c1","target":"record","created_at":"2026-05-18T02:49:19Z","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":"cfccc42b98d675971e7685d5268d00aa6b222e6d829445f7f2474b0a5c93abb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-06-10T17:04:23Z","title_canon_sha256":"bb466b227f1145262b0898ed63129e5a8cca01eafc047557f6c57f739d7b3152"},"schema_version":"1.0","source":{"id":"1406.2628","kind":"arxiv","version":2}},"canonical_sha256":"56d3c828a8f9dca5cbf170e602657cd6be2901538c74c99e4058f829f6b5e1a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56d3c828a8f9dca5cbf170e602657cd6be2901538c74c99e4058f829f6b5e1a2","first_computed_at":"2026-05-18T02:49:19.777690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:19.777690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RNlBxEE0f0urU6bslpni6/Dd6Myaj+5ej4CESzamk7K42P84pB9RQMj7GZDCX29v9g+nBILMfaIZ9XtEWZ0dCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:19.778465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2628","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dac6d801a0129351f71080aeb3d0e1acae770e8a06bc6aef2a3138e89aead0c1","sha256:704b988731e94a1f9b11dec0967ece48780889be9fe3aa1bb57c210d81c1bb22"],"state_sha256":"bf3cb9e0d0c41f3c3fe0abc7c3d93af025c0eaa6744d0b26811e6c2167f61d42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sy4PymOba8Qw/N/QNwDVPLrBo50Ievy/JmYPAjZLtsLHHoRABP49mN1no/wNGeeLgsdlkQiHca6NwTfdUz4rAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T20:30:31.052998Z","bundle_sha256":"08f5efbadb82b41569e19c1d7a31e94b6ba9f4166230b99ca669680c90f0208e"}}