{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TEM7QALSCW4STYCP4SODRAZV6Y","short_pith_number":"pith:TEM7QALS","canonical_record":{"source":{"id":"1502.04748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T23:13:32Z","cross_cats_sorted":[],"title_canon_sha256":"0e647861d35fb321f5a457f41ea8f711e1f2b815ed8f6cac6db8b581212106f5","abstract_canon_sha256":"cc15be848a82c6636b3c9e5fb76e74fcefb6591b5c9b7a69e8dfcf9b7676bb37"},"schema_version":"1.0"},"canonical_sha256":"9919f8017215b929e04fe49c388335f6061bf46870c6e56be006511f8f5c6a20","source":{"kind":"arxiv","id":"1502.04748","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04748","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04748v2","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04748","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"TEM7QALSCW4S","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TEM7QALSCW4STYCP","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TEM7QALS","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TEM7QALSCW4STYCP4SODRAZV6Y","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T23:13:32Z","cross_cats_sorted":[],"title_canon_sha256":"0e647861d35fb321f5a457f41ea8f711e1f2b815ed8f6cac6db8b581212106f5","abstract_canon_sha256":"cc15be848a82c6636b3c9e5fb76e74fcefb6591b5c9b7a69e8dfcf9b7676bb37"},"schema_version":"1.0"},"canonical_sha256":"9919f8017215b929e04fe49c388335f6061bf46870c6e56be006511f8f5c6a20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:28.202232Z","signature_b64":"r3WgvC12fwwyrn9iQnGYjYS5ZdoAl2j2GhsZunnslPc+3AaxGDmxmBRB24zCXBu0EeBA8q5cwAn2GfdANNb5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9919f8017215b929e04fe49c388335f6061bf46870c6e56be006511f8f5c6a20","last_reissued_at":"2026-05-18T02:24:28.201677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:28.201677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04748","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:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTXnTD/wbpr0i8Y8boaF4kaGfLhKauFYKbYMd9MLrRp0Jgo/nBJj2qEQC5s+3bi1NaQJ8SheUBfgfoem519YAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:34:14.946582Z"},"content_sha256":"21d637847ec912e4b5d696f23608ece4e3057c5ca5427716c34a46d80a2a17a0","schema_version":"1.0","event_id":"sha256:21d637847ec912e4b5d696f23608ece4e3057c5ca5427716c34a46d80a2a17a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TEM7QALSCW4STYCP4SODRAZV6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Takeoff Towards Optimal Sorting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Gregg, Martin Marinov","submitted_at":"2015-02-16T23:13:32Z","abstract_excerpt":"A complete set of filters $F_n$ for the optimal-depth $n$-input sorting network problem is such that if there exists an $n$-input sorting network of depth $d$ then there exists one of the form $C \\oplus C'$ for some $C \\in F_n$. Previous work on the topic presents a method for finding complete set of filters $R_{n, 1}$ and $R_{n, 2}$ that consists only of networks of depths one and two respectively, whose outputs are minimal and representative up to permutation and reflection. Our main contribution is a practical approach for finding a complete set of filters $R_{n, 3}$ containing only network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04748","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:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"au7LIb8x2WAa4L7bikoIK5uDm+MPwbS3+e38PJ5netrR0iAzbKFTjkn2U4VLD5p6qtoIuAZtgS0ASFaQIArrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:34:14.946933Z"},"content_sha256":"d4b36eb6100ed4c4d70d1655338a86af548e955ad352cf85ea929d8ea2ba69f0","schema_version":"1.0","event_id":"sha256:d4b36eb6100ed4c4d70d1655338a86af548e955ad352cf85ea929d8ea2ba69f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y/bundle.json","state_url":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TEM7QALSCW4STYCP4SODRAZV6Y/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-02T21:34:14Z","links":{"resolver":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y","bundle":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y/bundle.json","state":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TEM7QALSCW4STYCP4SODRAZV6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TEM7QALSCW4STYCP4SODRAZV6Y","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":"cc15be848a82c6636b3c9e5fb76e74fcefb6591b5c9b7a69e8dfcf9b7676bb37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T23:13:32Z","title_canon_sha256":"0e647861d35fb321f5a457f41ea8f711e1f2b815ed8f6cac6db8b581212106f5"},"schema_version":"1.0","source":{"id":"1502.04748","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04748","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04748v2","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04748","created_at":"2026-05-18T02:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"TEM7QALSCW4S","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TEM7QALSCW4STYCP","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TEM7QALS","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:d4b36eb6100ed4c4d70d1655338a86af548e955ad352cf85ea929d8ea2ba69f0","target":"graph","created_at":"2026-05-18T02:24:28Z","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":"A complete set of filters $F_n$ for the optimal-depth $n$-input sorting network problem is such that if there exists an $n$-input sorting network of depth $d$ then there exists one of the form $C \\oplus C'$ for some $C \\in F_n$. Previous work on the topic presents a method for finding complete set of filters $R_{n, 1}$ and $R_{n, 2}$ that consists only of networks of depths one and two respectively, whose outputs are minimal and representative up to permutation and reflection. Our main contribution is a practical approach for finding a complete set of filters $R_{n, 3}$ containing only network","authors_text":"David Gregg, Martin Marinov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T23:13:32Z","title":"The Takeoff Towards Optimal Sorting Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04748","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:21d637847ec912e4b5d696f23608ece4e3057c5ca5427716c34a46d80a2a17a0","target":"record","created_at":"2026-05-18T02:24:28Z","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":"cc15be848a82c6636b3c9e5fb76e74fcefb6591b5c9b7a69e8dfcf9b7676bb37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T23:13:32Z","title_canon_sha256":"0e647861d35fb321f5a457f41ea8f711e1f2b815ed8f6cac6db8b581212106f5"},"schema_version":"1.0","source":{"id":"1502.04748","kind":"arxiv","version":2}},"canonical_sha256":"9919f8017215b929e04fe49c388335f6061bf46870c6e56be006511f8f5c6a20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9919f8017215b929e04fe49c388335f6061bf46870c6e56be006511f8f5c6a20","first_computed_at":"2026-05-18T02:24:28.201677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:28.201677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r3WgvC12fwwyrn9iQnGYjYS5ZdoAl2j2GhsZunnslPc+3AaxGDmxmBRB24zCXBu0EeBA8q5cwAn2GfdANNb5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:28.202232Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04748","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21d637847ec912e4b5d696f23608ece4e3057c5ca5427716c34a46d80a2a17a0","sha256:d4b36eb6100ed4c4d70d1655338a86af548e955ad352cf85ea929d8ea2ba69f0"],"state_sha256":"d1e1265a9356b19c22eaeafb6fe89d548512a8735b17d151a28a91f4a6033436"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uxMOJlLQ4oG7+lvKvFfoYV9JNuftDfhJp2Pas6m6cf4P61W2uZgv5T6zjGySAC++P4ZdvRwP84k78Q6xkOWcDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:34:14.948915Z","bundle_sha256":"149ea048790f3d0e1ed35ef8dcd8f312360dbc928e1baf79fcca965bdf334afe"}}