{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TTOQSBQDNGL47W2ZSRSCCB2L2P","short_pith_number":"pith:TTOQSBQD","canonical_record":{"source":{"id":"1908.08111","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T20:31:34Z","cross_cats_sorted":[],"title_canon_sha256":"43909cd66c84f98cfcab46b6c11a6db9459e58d648b0006c6f9562b2f26545d9","abstract_canon_sha256":"456690a3e53796672d267124f4e8c9c684798237d595b6d2a1515e0d8f000d69"},"schema_version":"1.0"},"canonical_sha256":"9cdd0906036997cfdb59946421074bd3fca07f220c3d1bad7cac2d5d25531cf3","source":{"kind":"arxiv","id":"1908.08111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08111","created_at":"2026-07-04T23:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08111v1","created_at":"2026-07-04T23:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08111","created_at":"2026-07-04T23:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"TTOQSBQDNGL4","created_at":"2026-07-04T23:59:09Z"},{"alias_kind":"pith_short_16","alias_value":"TTOQSBQDNGL47W2Z","created_at":"2026-07-04T23:59:09Z"},{"alias_kind":"pith_short_8","alias_value":"TTOQSBQD","created_at":"2026-07-04T23:59:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TTOQSBQDNGL47W2ZSRSCCB2L2P","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08111","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T20:31:34Z","cross_cats_sorted":[],"title_canon_sha256":"43909cd66c84f98cfcab46b6c11a6db9459e58d648b0006c6f9562b2f26545d9","abstract_canon_sha256":"456690a3e53796672d267124f4e8c9c684798237d595b6d2a1515e0d8f000d69"},"schema_version":"1.0"},"canonical_sha256":"9cdd0906036997cfdb59946421074bd3fca07f220c3d1bad7cac2d5d25531cf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:09.789728Z","signature_b64":"6VVlz8sVE2wpD00vsFf+C2YO2SVqiO2GMZpV0ZG31I0Tm/ohdkOjRD9gX+opoXsVtIiuuhsQVT9AAA90qvaPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cdd0906036997cfdb59946421074bd3fca07f220c3d1bad7cac2d5d25531cf3","last_reissued_at":"2026-07-04T23:59:09.789330Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:09.789330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08111","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-07-04T23:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vmxSLVUZncMvmuZ3TDERxILU+DFovHJJ3dzBMMlGNYHbybeGiOYYbTx0p4i6+nl3LgM79zrtT1MwNiff/+maDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:48:18.344292Z"},"content_sha256":"615843b0853822499770b5aa9fca22629bca2aa3de06ef4033f46aa9d418ae20","schema_version":"1.0","event_id":"sha256:615843b0853822499770b5aa9fca22629bca2aa3de06ef4033f46aa9d418ae20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TTOQSBQDNGL47W2ZSRSCCB2L2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Engineering Faster Sorters for Small Sets of Items","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jasper Marianczuk","submitted_at":"2019-08-21T20:31:34Z","abstract_excerpt":"Sorting a set of items is a task that can be useful by itself or as a building block for more complex operations. The more sophisticated and fast sorting algorithms become asymptotically, the less efficient they are for small sets of items due to large constant factor. This thesis aims to determine if there is a faster way to sort base case sizes than using insertion sort. For that we looked at sorting networks and how to implement them efficiently. Because sorting networks need to be implemented explicitly for each input size, providing networks for larger sizes becomess less efficient. That "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08111","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08111/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TVJ3zPUq5im7v+g6SnVcKiXdPg06F1BFe/LwO7vEGDFcPP18EgmmkuGotvZNONyTBw3yVkq+qFysCIFo7c2FDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:48:18.344874Z"},"content_sha256":"8fe217d9c3148edaaf8545b6a84cdb3756e3fffd1ee2d0c5e0089c545c473185","schema_version":"1.0","event_id":"sha256:8fe217d9c3148edaaf8545b6a84cdb3756e3fffd1ee2d0c5e0089c545c473185"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTOQSBQDNGL47W2ZSRSCCB2L2P/bundle.json","state_url":"https://pith.science/pith/TTOQSBQDNGL47W2ZSRSCCB2L2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTOQSBQDNGL47W2ZSRSCCB2L2P/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-08-16T23:48:18Z","links":{"resolver":"https://pith.science/pith/TTOQSBQDNGL47W2ZSRSCCB2L2P","bundle":"https://pith.science/pith/TTOQSBQDNGL47W2ZSRSCCB2L2P/bundle.json","state":"https://pith.science/pith/TTOQSBQDNGL47W2ZSRSCCB2L2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTOQSBQDNGL47W2ZSRSCCB2L2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TTOQSBQDNGL47W2ZSRSCCB2L2P","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":"456690a3e53796672d267124f4e8c9c684798237d595b6d2a1515e0d8f000d69","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T20:31:34Z","title_canon_sha256":"43909cd66c84f98cfcab46b6c11a6db9459e58d648b0006c6f9562b2f26545d9"},"schema_version":"1.0","source":{"id":"1908.08111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08111","created_at":"2026-07-04T23:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08111v1","created_at":"2026-07-04T23:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08111","created_at":"2026-07-04T23:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"TTOQSBQDNGL4","created_at":"2026-07-04T23:59:09Z"},{"alias_kind":"pith_short_16","alias_value":"TTOQSBQDNGL47W2Z","created_at":"2026-07-04T23:59:09Z"},{"alias_kind":"pith_short_8","alias_value":"TTOQSBQD","created_at":"2026-07-04T23:59:09Z"}],"graph_snapshots":[{"event_id":"sha256:8fe217d9c3148edaaf8545b6a84cdb3756e3fffd1ee2d0c5e0089c545c473185","target":"graph","created_at":"2026-07-04T23:59:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.08111/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sorting a set of items is a task that can be useful by itself or as a building block for more complex operations. The more sophisticated and fast sorting algorithms become asymptotically, the less efficient they are for small sets of items due to large constant factor. This thesis aims to determine if there is a faster way to sort base case sizes than using insertion sort. For that we looked at sorting networks and how to implement them efficiently. Because sorting networks need to be implemented explicitly for each input size, providing networks for larger sizes becomess less efficient. That ","authors_text":"Jasper Marianczuk","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08111","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:615843b0853822499770b5aa9fca22629bca2aa3de06ef4033f46aa9d418ae20","target":"record","created_at":"2026-07-04T23:59:09Z","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":"456690a3e53796672d267124f4e8c9c684798237d595b6d2a1515e0d8f000d69","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T20:31:34Z","title_canon_sha256":"43909cd66c84f98cfcab46b6c11a6db9459e58d648b0006c6f9562b2f26545d9"},"schema_version":"1.0","source":{"id":"1908.08111","kind":"arxiv","version":1}},"canonical_sha256":"9cdd0906036997cfdb59946421074bd3fca07f220c3d1bad7cac2d5d25531cf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cdd0906036997cfdb59946421074bd3fca07f220c3d1bad7cac2d5d25531cf3","first_computed_at":"2026-07-04T23:59:09.789330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:09.789330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6VVlz8sVE2wpD00vsFf+C2YO2SVqiO2GMZpV0ZG31I0Tm/ohdkOjRD9gX+opoXsVtIiuuhsQVT9AAA90qvaPDQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:09.789728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:615843b0853822499770b5aa9fca22629bca2aa3de06ef4033f46aa9d418ae20","sha256:8fe217d9c3148edaaf8545b6a84cdb3756e3fffd1ee2d0c5e0089c545c473185"],"state_sha256":"efa4b415f3bebb9c7c92ed7cd14d82bd9edbe13b4574d63b401dc13e375a1d0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i86f66hPqGPStrCFUr2GA3RbvUJeG/+TFdRjVTeBhmVFX08cNzzvDmrT4KBO+SgZaj3U2dTRNDWKC9PCcbxMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T23:48:18.348596Z","bundle_sha256":"4d4415cf3f35ccb9a0828e909c675bf7e96f096aff661f876727802ca7cd0ed9"}}