{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LVVBGQ4RUXAWJIVEAL5A52OUEN","short_pith_number":"pith:LVVBGQ4R","canonical_record":{"source":{"id":"1610.03266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-11T10:21:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"327a00571758c6db3c6c9d4257d28e85b9c28b4ad4d2ab6ab2e2491fa137af4c","abstract_canon_sha256":"66d47ba1e6f46181c5eb5197e6316e2a89309c71c857ba05ef595d176c83363f"},"schema_version":"1.0"},"canonical_sha256":"5d6a134391a5c164a2a402fa0ee9d42351f41eb46907605e1dd027c9787e6cf5","source":{"kind":"arxiv","id":"1610.03266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03266","created_at":"2026-05-18T01:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03266v1","created_at":"2026-05-18T01:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03266","created_at":"2026-05-18T01:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"LVVBGQ4RUXAW","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LVVBGQ4RUXAWJIVE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LVVBGQ4R","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LVVBGQ4RUXAWJIVEAL5A52OUEN","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-11T10:21:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"327a00571758c6db3c6c9d4257d28e85b9c28b4ad4d2ab6ab2e2491fa137af4c","abstract_canon_sha256":"66d47ba1e6f46181c5eb5197e6316e2a89309c71c857ba05ef595d176c83363f"},"schema_version":"1.0"},"canonical_sha256":"5d6a134391a5c164a2a402fa0ee9d42351f41eb46907605e1dd027c9787e6cf5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:35.884972Z","signature_b64":"fpDRv3DEvkI/otodVygsOIUqPgs6biq0G2F8NTmPCUiL5RPURwAkTleAENuqEAMiVrRLgYAyfMUYhjDgeB10BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d6a134391a5c164a2a402fa0ee9d42351f41eb46907605e1dd027c9787e6cf5","last_reissued_at":"2026-05-18T01:02:35.884293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:35.884293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03266","source_version":1,"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-18T01:02:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NoApvDZAFWyuMA0tzhSpu4TQ3+cBR9GIAn5repdrj9LeFAgRxW43dHNlWyKS+18Cr1xLCGu1ICOV8IEYNIQIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:24:33.658289Z"},"content_sha256":"9fd859c8a8aabb39712f12a17f4b2c57d2b1bb37116a757e3015422e06ccf9f0","schema_version":"1.0","event_id":"sha256:9fd859c8a8aabb39712f12a17f4b2c57d2b1bb37116a757e3015422e06ccf9f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LVVBGQ4RUXAWJIVEAL5A52OUEN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimality of Tape Merge of Two Lists with Similar Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Jialin Zhang, Qian Li, Xiaoming Sun","submitted_at":"2016-10-11T10:21:28Z","abstract_excerpt":"The problem of merging sorted lists in the least number of pairwise comparisons has been solved completely only for a few special cases. Graham and Karp \\cite{taocp} independently discovered that the tape merge algorithm is optimal in the worst case when the two lists have the same size. In the seminal papers, Stockmeyer and Yao\\cite{yao}, Murphy and Paull\\cite{3k3}, and Christen\\cite{christen1978optimality} independently showed when the lists to be merged are of size $m$ and $n$ satisfying $m\\leq n\\leq\\lfloor\\frac{3}{2}m\\rfloor+1$, the tape merge algorithm is optimal in the worst case. This p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03266","kind":"arxiv","version":1},"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-18T01:02:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1YcGr0zO9xIvj0+tJwdYAiWo8YUFRZcaHXAVVMH6wub7uErVLj3RNJDJKu4bZe5LLxhRwYBiyL2B7J27JwwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:24:33.658656Z"},"content_sha256":"d051bd966476275ec86421e010bfaa982a7e9abe303309ac3587d152c9cb6ac2","schema_version":"1.0","event_id":"sha256:d051bd966476275ec86421e010bfaa982a7e9abe303309ac3587d152c9cb6ac2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN/bundle.json","state_url":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN/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-05T09:24:33Z","links":{"resolver":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN","bundle":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN/bundle.json","state":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LVVBGQ4RUXAWJIVEAL5A52OUEN","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":"66d47ba1e6f46181c5eb5197e6316e2a89309c71c857ba05ef595d176c83363f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-11T10:21:28Z","title_canon_sha256":"327a00571758c6db3c6c9d4257d28e85b9c28b4ad4d2ab6ab2e2491fa137af4c"},"schema_version":"1.0","source":{"id":"1610.03266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03266","created_at":"2026-05-18T01:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03266v1","created_at":"2026-05-18T01:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03266","created_at":"2026-05-18T01:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"LVVBGQ4RUXAW","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LVVBGQ4RUXAWJIVE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LVVBGQ4R","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:d051bd966476275ec86421e010bfaa982a7e9abe303309ac3587d152c9cb6ac2","target":"graph","created_at":"2026-05-18T01:02:35Z","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":"The problem of merging sorted lists in the least number of pairwise comparisons has been solved completely only for a few special cases. Graham and Karp \\cite{taocp} independently discovered that the tape merge algorithm is optimal in the worst case when the two lists have the same size. In the seminal papers, Stockmeyer and Yao\\cite{yao}, Murphy and Paull\\cite{3k3}, and Christen\\cite{christen1978optimality} independently showed when the lists to be merged are of size $m$ and $n$ satisfying $m\\leq n\\leq\\lfloor\\frac{3}{2}m\\rfloor+1$, the tape merge algorithm is optimal in the worst case. This p","authors_text":"Jialin Zhang, Qian Li, Xiaoming Sun","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-11T10:21:28Z","title":"On the Optimality of Tape Merge of Two Lists with Similar Size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03266","kind":"arxiv","version":1},"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:9fd859c8a8aabb39712f12a17f4b2c57d2b1bb37116a757e3015422e06ccf9f0","target":"record","created_at":"2026-05-18T01:02:35Z","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":"66d47ba1e6f46181c5eb5197e6316e2a89309c71c857ba05ef595d176c83363f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-11T10:21:28Z","title_canon_sha256":"327a00571758c6db3c6c9d4257d28e85b9c28b4ad4d2ab6ab2e2491fa137af4c"},"schema_version":"1.0","source":{"id":"1610.03266","kind":"arxiv","version":1}},"canonical_sha256":"5d6a134391a5c164a2a402fa0ee9d42351f41eb46907605e1dd027c9787e6cf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d6a134391a5c164a2a402fa0ee9d42351f41eb46907605e1dd027c9787e6cf5","first_computed_at":"2026-05-18T01:02:35.884293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:35.884293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fpDRv3DEvkI/otodVygsOIUqPgs6biq0G2F8NTmPCUiL5RPURwAkTleAENuqEAMiVrRLgYAyfMUYhjDgeB10BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:35.884972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fd859c8a8aabb39712f12a17f4b2c57d2b1bb37116a757e3015422e06ccf9f0","sha256:d051bd966476275ec86421e010bfaa982a7e9abe303309ac3587d152c9cb6ac2"],"state_sha256":"6d456d9f46f11e044c60fc208b50c3ef31acac22980d2bb68acac258cf9139a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gq5/GRECkODYziQBDBjL7yDQtxJqMtHscP8VwPC31eBuucsc+Mvq7i3wJQe7gyefgOkJncXKYSpf5fy3n+1nDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:24:33.660538Z","bundle_sha256":"5e4530577cf20f28fb760511e427e59bd4c41b1385586bb4a0dc1560b8e961ee"}}