{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:CSAOGPFUBVBGRGYRA2IJ3WOKIG","short_pith_number":"pith:CSAOGPFU","canonical_record":{"source":{"id":"2401.00710","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-01-01T09:39:12Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"772502018425571680be4c2a926c9d8f20d236bbb024262c069e8713b4efb4aa","abstract_canon_sha256":"459a7ce562113551a33239b5b228ccc73cc3f4751a8bb3972c71008cc2ad2f15"},"schema_version":"1.0"},"canonical_sha256":"1480e33cb40d42689b1106909dd9ca418131f25ebb01fb28279638975159a42a","source":{"kind":"arxiv","id":"2401.00710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.00710","created_at":"2026-05-20T00:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"2401.00710v1","created_at":"2026-05-20T00:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.00710","created_at":"2026-05-20T00:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"CSAOGPFUBVBG","created_at":"2026-05-20T00:00:14Z"},{"alias_kind":"pith_short_16","alias_value":"CSAOGPFUBVBGRGYR","created_at":"2026-05-20T00:00:14Z"},{"alias_kind":"pith_short_8","alias_value":"CSAOGPFU","created_at":"2026-05-20T00:00:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:CSAOGPFUBVBGRGYRA2IJ3WOKIG","target":"record","payload":{"canonical_record":{"source":{"id":"2401.00710","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-01-01T09:39:12Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"772502018425571680be4c2a926c9d8f20d236bbb024262c069e8713b4efb4aa","abstract_canon_sha256":"459a7ce562113551a33239b5b228ccc73cc3f4751a8bb3972c71008cc2ad2f15"},"schema_version":"1.0"},"canonical_sha256":"1480e33cb40d42689b1106909dd9ca418131f25ebb01fb28279638975159a42a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:14.752588Z","signature_b64":"bsOmpzhRLla7Z8nHO6b96oWE0l+4/s7224Hhta6fFYeY9BzLPRdECHxudbyyGTP3C4LDzN49Cfm0sHwIkE+7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1480e33cb40d42689b1106909dd9ca418131f25ebb01fb28279638975159a42a","last_reissued_at":"2026-05-20T00:00:14.751677Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:14.751677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.00710","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-20T00:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"urI9Nf3v23+KkDbLvLoJtEzw1gnbUs72MQe50/dmC82oAk+HisWfHIrwwCiZVQNqMkRkECS366mkqTSpxeNyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:04:04.137544Z"},"content_sha256":"97ae31cafbf6726da80b26372e2380700e1ff539d314ebdb9bcbe4ac8a8689bd","schema_version":"1.0","event_id":"sha256:97ae31cafbf6726da80b26372e2380700e1ff539d314ebdb9bcbe4ac8a8689bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:CSAOGPFUBVBGRGYRA2IJ3WOKIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Integer Sort: Theory and Practice","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Laxman Dhulipala, Xiaojun Dong, Yan Gu, Yihan Sun","submitted_at":"2024-01-01T09:39:12Z","abstract_excerpt":"Integer sorting is a fundamental problem in computer science. This paper studies parallel integer sort both in theory and in practice. In theory, we show tighter bounds for a class of existing practical integer sort algorithms, which provides a solid theoretical foundation for their widespread usage in practice and strong performance. In practice, we design a new integer sorting algorithm, \\textsf{DovetailSort}, that is theoretically-efficient and has good practical performance.\n  In particular, \\textsf{DovetailSort} overcomes a common challenge in existing parallel integer sorting algorithms,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.00710","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/2401.00710/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-05-20T00:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mCsFtJ/gpn3uPuf5unRb4UrxmMpCW7zOsPxITFtJBrJ3fdjbyJAgGf/qUBwwHSJxJqWTxXtwg9YAB9u0odXnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:04:04.138235Z"},"content_sha256":"014492dbc3106631530f3dc993fc5a46496036719d3787d3ea98aec60297c5bd","schema_version":"1.0","event_id":"sha256:014492dbc3106631530f3dc993fc5a46496036719d3787d3ea98aec60297c5bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG/bundle.json","state_url":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG/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-30T05:04:04Z","links":{"resolver":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG","bundle":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG/bundle.json","state":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CSAOGPFUBVBGRGYRA2IJ3WOKIG","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":"459a7ce562113551a33239b5b228ccc73cc3f4751a8bb3972c71008cc2ad2f15","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-01-01T09:39:12Z","title_canon_sha256":"772502018425571680be4c2a926c9d8f20d236bbb024262c069e8713b4efb4aa"},"schema_version":"1.0","source":{"id":"2401.00710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.00710","created_at":"2026-05-20T00:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"2401.00710v1","created_at":"2026-05-20T00:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.00710","created_at":"2026-05-20T00:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"CSAOGPFUBVBG","created_at":"2026-05-20T00:00:14Z"},{"alias_kind":"pith_short_16","alias_value":"CSAOGPFUBVBGRGYR","created_at":"2026-05-20T00:00:14Z"},{"alias_kind":"pith_short_8","alias_value":"CSAOGPFU","created_at":"2026-05-20T00:00:14Z"}],"graph_snapshots":[{"event_id":"sha256:014492dbc3106631530f3dc993fc5a46496036719d3787d3ea98aec60297c5bd","target":"graph","created_at":"2026-05-20T00:00:14Z","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/2401.00710/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Integer sorting is a fundamental problem in computer science. This paper studies parallel integer sort both in theory and in practice. In theory, we show tighter bounds for a class of existing practical integer sort algorithms, which provides a solid theoretical foundation for their widespread usage in practice and strong performance. In practice, we design a new integer sorting algorithm, \\textsf{DovetailSort}, that is theoretically-efficient and has good practical performance.\n  In particular, \\textsf{DovetailSort} overcomes a common challenge in existing parallel integer sorting algorithms,","authors_text":"Laxman Dhulipala, Xiaojun Dong, Yan Gu, Yihan Sun","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-01-01T09:39:12Z","title":"Parallel Integer Sort: Theory and Practice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.00710","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:97ae31cafbf6726da80b26372e2380700e1ff539d314ebdb9bcbe4ac8a8689bd","target":"record","created_at":"2026-05-20T00:00:14Z","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":"459a7ce562113551a33239b5b228ccc73cc3f4751a8bb3972c71008cc2ad2f15","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-01-01T09:39:12Z","title_canon_sha256":"772502018425571680be4c2a926c9d8f20d236bbb024262c069e8713b4efb4aa"},"schema_version":"1.0","source":{"id":"2401.00710","kind":"arxiv","version":1}},"canonical_sha256":"1480e33cb40d42689b1106909dd9ca418131f25ebb01fb28279638975159a42a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1480e33cb40d42689b1106909dd9ca418131f25ebb01fb28279638975159a42a","first_computed_at":"2026-05-20T00:00:14.751677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:14.751677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bsOmpzhRLla7Z8nHO6b96oWE0l+4/s7224Hhta6fFYeY9BzLPRdECHxudbyyGTP3C4LDzN49Cfm0sHwIkE+7BQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:14.752588Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.00710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97ae31cafbf6726da80b26372e2380700e1ff539d314ebdb9bcbe4ac8a8689bd","sha256:014492dbc3106631530f3dc993fc5a46496036719d3787d3ea98aec60297c5bd"],"state_sha256":"18ecd1036e308c3aecfa84b8f2b637d7aabc835216cec68b96c121e504dd0962"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WWA6gN3UGprQmYwiBgZDD/m8UWBz28P4AvuPP8eXeyqwPWUUjpiiODuGhELisZNmf8rLc50aerUn63509RXPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:04:04.142115Z","bundle_sha256":"9e1479396b3d279c103ee3edc3d48696f1eaa6c3d324b26acc7db53f3ac53089"}}