{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LVVBGQ4RUXAWJIVEAL5A52OUEN","short_pith_number":"pith:LVVBGQ4R","schema_version":"1.0","canonical_sha256":"5d6a134391a5c164a2a402fa0ee9d42351f41eb46907605e1dd027c9787e6cf5","source":{"kind":"arxiv","id":"1610.03266","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.03266","created_at":"2026-05-18T01:02:35.884429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03266v1","created_at":"2026-05-18T01:02:35.884429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03266","created_at":"2026-05-18T01:02:35.884429+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVVBGQ4RUXAW","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVVBGQ4RUXAWJIVE","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVVBGQ4R","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN","json":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN.json","graph_json":"https://pith.science/api/pith-number/LVVBGQ4RUXAWJIVEAL5A52OUEN/graph.json","events_json":"https://pith.science/api/pith-number/LVVBGQ4RUXAWJIVEAL5A52OUEN/events.json","paper":"https://pith.science/paper/LVVBGQ4R"},"agent_actions":{"view_html":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN","download_json":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN.json","view_paper":"https://pith.science/paper/LVVBGQ4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03266&json=true","fetch_graph":"https://pith.science/api/pith-number/LVVBGQ4RUXAWJIVEAL5A52OUEN/graph.json","fetch_events":"https://pith.science/api/pith-number/LVVBGQ4RUXAWJIVEAL5A52OUEN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN/action/storage_attestation","attest_author":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN/action/author_attestation","sign_citation":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN/action/citation_signature","submit_replication":"https://pith.science/pith/LVVBGQ4RUXAWJIVEAL5A52OUEN/action/replication_record"}},"created_at":"2026-05-18T01:02:35.884429+00:00","updated_at":"2026-05-18T01:02:35.884429+00:00"}