{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YPCRC4HXCO6KHQVQOEJF6ZBYAT","short_pith_number":"pith:YPCRC4HX","canonical_record":{"source":{"id":"1407.0961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-03T15:47:23Z","cross_cats_sorted":[],"title_canon_sha256":"20db60f8ade75924c94d487d778af213dcfcdafde880f20053b873ad9aa37815","abstract_canon_sha256":"e2d2dbe73bc9017612ec3f1daa21f9f4ce96e877fcfc4905e696834e5b42fef7"},"schema_version":"1.0"},"canonical_sha256":"c3c51170f713bca3c2b071125f643804f7575ac8a26a35363498977026573919","source":{"kind":"arxiv","id":"1407.0961","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0961","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0961v1","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0961","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"YPCRC4HXCO6K","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YPCRC4HXCO6KHQVQ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YPCRC4HX","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YPCRC4HXCO6KHQVQOEJF6ZBYAT","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-03T15:47:23Z","cross_cats_sorted":[],"title_canon_sha256":"20db60f8ade75924c94d487d778af213dcfcdafde880f20053b873ad9aa37815","abstract_canon_sha256":"e2d2dbe73bc9017612ec3f1daa21f9f4ce96e877fcfc4905e696834e5b42fef7"},"schema_version":"1.0"},"canonical_sha256":"c3c51170f713bca3c2b071125f643804f7575ac8a26a35363498977026573919","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:25.061567Z","signature_b64":"XGxfZDRhJflV3yJH0e5Iq3oR28igQfu96671Wua0NpnU8O1FDZaSuOIjPZ3Lespr1kN4MgDcoaTBOcgF1yi+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3c51170f713bca3c2b071125f643804f7575ac8a26a35363498977026573919","last_reissued_at":"2026-05-18T02:48:25.061103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:25.061103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0961","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-18T02:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gUfZQPclfbzWs5WXLZfnZ4OatU4atYGZFo99Q/DJPxBtyjmhyxysi20oUkvQ0IO/OzeJ710+JTTp2lKp+2jSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:33:58.222470Z"},"content_sha256":"bafb59afc672369ed030053086594cbb5ef31f2c148b6fad966150ce4b7f8550","schema_version":"1.0","event_id":"sha256:bafb59afc672369ed030053086594cbb5ef31f2c148b6fad966150ce4b7f8550"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YPCRC4HXCO6KHQVQOEJF6ZBYAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Enhanced Multiway Sorting Network Based on n-Sorters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Feng Shi, Meghanad Wagh, Zhiyuan Yan","submitted_at":"2014-07-03T15:47:23Z","abstract_excerpt":"Merging-based sorting networks are an important family of sorting networks. Most merge sorting networks are based on 2-way or multi-way merging algorithms using 2-sorters as basic building blocks. An alternative is to use n-sorters, instead of 2-sorters, as the basic building blocks so as to greatly reduce the number of sorters as well as the latency. Based on a modified Leighton's columnsort algorithm, an n-way merging algorithm, referred to as SS-Mk, that uses n-sorters as basic building blocks was proposed. In this work, we first propose a new multiway merging algorithm with n-sorters as ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0961","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-18T02:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dnzuWyKDR25y7yFtPPfka4o24fPwoILLReakRlPNzGpFQUEk28FcQLfaZqfDKNmdFEIw2Me7LoCjcqFpB4GjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:33:58.222957Z"},"content_sha256":"0a34c0dc958ac3c530c78692f892f58acfeee7b726c925363186dce851cd7b0b","schema_version":"1.0","event_id":"sha256:0a34c0dc958ac3c530c78692f892f58acfeee7b726c925363186dce851cd7b0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPCRC4HXCO6KHQVQOEJF6ZBYAT/bundle.json","state_url":"https://pith.science/pith/YPCRC4HXCO6KHQVQOEJF6ZBYAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPCRC4HXCO6KHQVQOEJF6ZBYAT/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-05-30T16:33:58Z","links":{"resolver":"https://pith.science/pith/YPCRC4HXCO6KHQVQOEJF6ZBYAT","bundle":"https://pith.science/pith/YPCRC4HXCO6KHQVQOEJF6ZBYAT/bundle.json","state":"https://pith.science/pith/YPCRC4HXCO6KHQVQOEJF6ZBYAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPCRC4HXCO6KHQVQOEJF6ZBYAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YPCRC4HXCO6KHQVQOEJF6ZBYAT","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":"e2d2dbe73bc9017612ec3f1daa21f9f4ce96e877fcfc4905e696834e5b42fef7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-03T15:47:23Z","title_canon_sha256":"20db60f8ade75924c94d487d778af213dcfcdafde880f20053b873ad9aa37815"},"schema_version":"1.0","source":{"id":"1407.0961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0961","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0961v1","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0961","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"YPCRC4HXCO6K","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YPCRC4HXCO6KHQVQ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YPCRC4HX","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:0a34c0dc958ac3c530c78692f892f58acfeee7b726c925363186dce851cd7b0b","target":"graph","created_at":"2026-05-18T02:48:25Z","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-based sorting networks are an important family of sorting networks. Most merge sorting networks are based on 2-way or multi-way merging algorithms using 2-sorters as basic building blocks. An alternative is to use n-sorters, instead of 2-sorters, as the basic building blocks so as to greatly reduce the number of sorters as well as the latency. Based on a modified Leighton's columnsort algorithm, an n-way merging algorithm, referred to as SS-Mk, that uses n-sorters as basic building blocks was proposed. In this work, we first propose a new multiway merging algorithm with n-sorters as ba","authors_text":"Feng Shi, Meghanad Wagh, Zhiyuan Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-03T15:47:23Z","title":"An Enhanced Multiway Sorting Network Based on n-Sorters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0961","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:bafb59afc672369ed030053086594cbb5ef31f2c148b6fad966150ce4b7f8550","target":"record","created_at":"2026-05-18T02:48:25Z","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":"e2d2dbe73bc9017612ec3f1daa21f9f4ce96e877fcfc4905e696834e5b42fef7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-03T15:47:23Z","title_canon_sha256":"20db60f8ade75924c94d487d778af213dcfcdafde880f20053b873ad9aa37815"},"schema_version":"1.0","source":{"id":"1407.0961","kind":"arxiv","version":1}},"canonical_sha256":"c3c51170f713bca3c2b071125f643804f7575ac8a26a35363498977026573919","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3c51170f713bca3c2b071125f643804f7575ac8a26a35363498977026573919","first_computed_at":"2026-05-18T02:48:25.061103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:25.061103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XGxfZDRhJflV3yJH0e5Iq3oR28igQfu96671Wua0NpnU8O1FDZaSuOIjPZ3Lespr1kN4MgDcoaTBOcgF1yi+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:25.061567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bafb59afc672369ed030053086594cbb5ef31f2c148b6fad966150ce4b7f8550","sha256:0a34c0dc958ac3c530c78692f892f58acfeee7b726c925363186dce851cd7b0b"],"state_sha256":"01b20a90f4756bbf931b7a53a612c75a7e60e30c223ed4f229b0b990caf223c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"witq/fDfQJB/hrm9ZkUwPGe8lsiephGA7ed4PfFCBNCQeqQKZgT8vwhVNbHcjqmNZmirHpFJ9DqMswpBWYLMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:33:58.226567Z","bundle_sha256":"bb4962e3269e86a9f810dd59b3ff55f7cc9abe39ee6a62f3da9594bfd125f739"}}