{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:667APSK63KGNNAHF3SO5CGZX3G","short_pith_number":"pith:667APSK6","canonical_record":{"source":{"id":"1508.00292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-02T23:39:58Z","cross_cats_sorted":[],"title_canon_sha256":"ef4a00a84e2042ae4ec0a5f33961ee56b0532a359045e6ce6b7790f326a73f5f","abstract_canon_sha256":"7ee6c5017f232e7a26583f82cae5863694dd4e1050d1fd41fcec5c0eb508df44"},"schema_version":"1.0"},"canonical_sha256":"f7be07c95eda8cd680e5dc9dd11b37d990848e0f2cb065f05328f11c0d8256aa","source":{"kind":"arxiv","id":"1508.00292","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00292","created_at":"2026-05-18T01:35:58Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00292v1","created_at":"2026-05-18T01:35:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00292","created_at":"2026-05-18T01:35:58Z"},{"alias_kind":"pith_short_12","alias_value":"667APSK63KGN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"667APSK63KGNNAHF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"667APSK6","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:667APSK63KGNNAHF3SO5CGZX3G","target":"record","payload":{"canonical_record":{"source":{"id":"1508.00292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-02T23:39:58Z","cross_cats_sorted":[],"title_canon_sha256":"ef4a00a84e2042ae4ec0a5f33961ee56b0532a359045e6ce6b7790f326a73f5f","abstract_canon_sha256":"7ee6c5017f232e7a26583f82cae5863694dd4e1050d1fd41fcec5c0eb508df44"},"schema_version":"1.0"},"canonical_sha256":"f7be07c95eda8cd680e5dc9dd11b37d990848e0f2cb065f05328f11c0d8256aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:58.504550Z","signature_b64":"GgjufhSmx3QeGHDh6BduX0BO4GHrWfXFly8HXjndOoL4z+b8mB/yE+QH99NW/yhsxv1fE5sTkV1Ach+UWGRRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7be07c95eda8cd680e5dc9dd11b37d990848e0f2cb065f05328f11c0d8256aa","last_reissued_at":"2026-05-18T01:35:58.504013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:58.504013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.00292","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:35:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egUUc5tj/hHP59alvKsxDpN0wMffC5F4vorqW+/o+kEwYCNIMVQ460rpkBNkLEizxC8aJ3DuWcd4J8Un7IIyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:28:48.436147Z"},"content_sha256":"3591bf78c7c211b68065385a755b806e277aecd9d7720c30ef58c3f692d8bcc1","schema_version":"1.0","event_id":"sha256:3591bf78c7c211b68065385a755b806e277aecd9d7720c30ef58c3f692d8bcc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:667APSK63KGNNAHF3SO5CGZX3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Provably, Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Ellis, Ulrike Stege","submitted_at":"2015-08-02T23:39:58Z","abstract_excerpt":"We reconsider a recently published algorithm (Dalkilic et al.) for merging lists by way of the perfect shuffle. The original publication gave only experimental results which, although consistent with linear execution time on the samples tested, provided no analysis. Here we prove that the time complexity, in the average case, is indeed linear, although there is an Omega(n^2) worst case. This is then the first provably linear time merge algorithm based on the use of the perfect shuffle. We provide a proof of correctness, extend the algorithm to the general case where the lists are of unequal le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00292","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:35:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AXpwD96MQMhME4t1soJHcvMR5xI6aInJU62BwuPS69PdswM78BsazmMFj5nwxmBuiHxeHGqazoOEocOREPVTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:28:48.436512Z"},"content_sha256":"462816319da3fc4b350c7afeb3ab5135f4a595b0bb2697edc0265bfe3bc87a16","schema_version":"1.0","event_id":"sha256:462816319da3fc4b350c7afeb3ab5135f4a595b0bb2697edc0265bfe3bc87a16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/667APSK63KGNNAHF3SO5CGZX3G/bundle.json","state_url":"https://pith.science/pith/667APSK63KGNNAHF3SO5CGZX3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/667APSK63KGNNAHF3SO5CGZX3G/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-03T02:28:48Z","links":{"resolver":"https://pith.science/pith/667APSK63KGNNAHF3SO5CGZX3G","bundle":"https://pith.science/pith/667APSK63KGNNAHF3SO5CGZX3G/bundle.json","state":"https://pith.science/pith/667APSK63KGNNAHF3SO5CGZX3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/667APSK63KGNNAHF3SO5CGZX3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:667APSK63KGNNAHF3SO5CGZX3G","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":"7ee6c5017f232e7a26583f82cae5863694dd4e1050d1fd41fcec5c0eb508df44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-02T23:39:58Z","title_canon_sha256":"ef4a00a84e2042ae4ec0a5f33961ee56b0532a359045e6ce6b7790f326a73f5f"},"schema_version":"1.0","source":{"id":"1508.00292","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00292","created_at":"2026-05-18T01:35:58Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00292v1","created_at":"2026-05-18T01:35:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00292","created_at":"2026-05-18T01:35:58Z"},{"alias_kind":"pith_short_12","alias_value":"667APSK63KGN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"667APSK63KGNNAHF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"667APSK6","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:462816319da3fc4b350c7afeb3ab5135f4a595b0bb2697edc0265bfe3bc87a16","target":"graph","created_at":"2026-05-18T01:35:58Z","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 reconsider a recently published algorithm (Dalkilic et al.) for merging lists by way of the perfect shuffle. The original publication gave only experimental results which, although consistent with linear execution time on the samples tested, provided no analysis. Here we prove that the time complexity, in the average case, is indeed linear, although there is an Omega(n^2) worst case. This is then the first provably linear time merge algorithm based on the use of the perfect shuffle. We provide a proof of correctness, extend the algorithm to the general case where the lists are of unequal le","authors_text":"John Ellis, Ulrike Stege","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-02T23:39:58Z","title":"A Provably, Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00292","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:3591bf78c7c211b68065385a755b806e277aecd9d7720c30ef58c3f692d8bcc1","target":"record","created_at":"2026-05-18T01:35:58Z","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":"7ee6c5017f232e7a26583f82cae5863694dd4e1050d1fd41fcec5c0eb508df44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-02T23:39:58Z","title_canon_sha256":"ef4a00a84e2042ae4ec0a5f33961ee56b0532a359045e6ce6b7790f326a73f5f"},"schema_version":"1.0","source":{"id":"1508.00292","kind":"arxiv","version":1}},"canonical_sha256":"f7be07c95eda8cd680e5dc9dd11b37d990848e0f2cb065f05328f11c0d8256aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7be07c95eda8cd680e5dc9dd11b37d990848e0f2cb065f05328f11c0d8256aa","first_computed_at":"2026-05-18T01:35:58.504013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:58.504013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GgjufhSmx3QeGHDh6BduX0BO4GHrWfXFly8HXjndOoL4z+b8mB/yE+QH99NW/yhsxv1fE5sTkV1Ach+UWGRRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:58.504550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00292","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3591bf78c7c211b68065385a755b806e277aecd9d7720c30ef58c3f692d8bcc1","sha256:462816319da3fc4b350c7afeb3ab5135f4a595b0bb2697edc0265bfe3bc87a16"],"state_sha256":"6ef29aad33aca6a468b90bfc4dab31928d629909cf61dbfa5dba389d61ce3b44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6J4mB2d097FKTizSfDMh4hV37yeIKR1OS77GnhWG80oloiU3ef4e1ElPH83TSHZfmrlsUUCsGTtNOc3d23WLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:28:48.438497Z","bundle_sha256":"35dac6c29bf766216d60a9de229a437a0b0568ac7271c52530479ff0036546ee"}}