{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5ZUSDK7XWTJZKPE57OSZ7GJCMR","short_pith_number":"pith:5ZUSDK7X","canonical_record":{"source":{"id":"1310.7890","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2013-10-26T20:09:13Z","cross_cats_sorted":[],"title_canon_sha256":"2f5d027c4faf40f2eff75a3edad5067dcc8e1a29bdae225cc01f1c3024b9e7fa","abstract_canon_sha256":"00af18faa55d5a6385286026525a9f58b7955ee78199d329a592e222a8d826e8"},"schema_version":"1.0"},"canonical_sha256":"ee6921abf7b4d3953c9dfba59f992264444f5c065242865acb1a6c49593fbf87","source":{"kind":"arxiv","id":"1310.7890","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7890","created_at":"2026-05-18T03:08:27Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7890v1","created_at":"2026-05-18T03:08:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7890","created_at":"2026-05-18T03:08:27Z"},{"alias_kind":"pith_short_12","alias_value":"5ZUSDK7XWTJZ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5ZUSDK7XWTJZKPE5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5ZUSDK7X","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5ZUSDK7XWTJZKPE57OSZ7GJCMR","target":"record","payload":{"canonical_record":{"source":{"id":"1310.7890","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2013-10-26T20:09:13Z","cross_cats_sorted":[],"title_canon_sha256":"2f5d027c4faf40f2eff75a3edad5067dcc8e1a29bdae225cc01f1c3024b9e7fa","abstract_canon_sha256":"00af18faa55d5a6385286026525a9f58b7955ee78199d329a592e222a8d826e8"},"schema_version":"1.0"},"canonical_sha256":"ee6921abf7b4d3953c9dfba59f992264444f5c065242865acb1a6c49593fbf87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:27.716260Z","signature_b64":"xKohFifbT37Bs/KNgbAPwUoMZJdBc6vpab8SMU2T/rDnEcxI5b4EkXtn2ltKF12VNiEfRZz3TKFObVARxlZSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee6921abf7b4d3953c9dfba59f992264444f5c065242865acb1a6c49593fbf87","last_reissued_at":"2026-05-18T03:08:27.715600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:27.715600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.7890","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-18T03:08:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DEqJMTmBmOYnHve0FPx0w2Msh/3US1QZYAtTLFZHJgQRto6krMF9LT6LY54d3L3ENPUf6YhQhYrUXd8xlAPmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:55:58.144482Z"},"content_sha256":"6b95d0392426469ddc00f347617913fcb5d8b6730c329ae017aa6287ba49da02","schema_version":"1.0","event_id":"sha256:6b95d0392426469ddc00f347617913fcb5d8b6730c329ae017aa6287ba49da02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5ZUSDK7XWTJZKPE57OSZ7GJCMR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List Sort: A New Approach for Sorting List to Reduce Execution Time","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adarsh Kumar Verma, Prashant Kumar","submitted_at":"2013-10-26T20:09:13Z","abstract_excerpt":"In this paper we are proposing a new sorting algorithm, List Sort algorithm, is based on the dynamic memory allocation. In this research study we have also shown the comparison of various efficient sorting techniques with List sort. Due the dynamic nature of the List sort, it becomes much more fast than some conventional comparison sorting techniques and comparable to Quick Sort and Merge Sort. List sort takes the advantage of the data which is already sorted either in ascending order or in descending order."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7890","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-18T03:08:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1J8Bsl8EEt6PMLB17gGeHy3Eb8MKRhtailmKe3cMNH1yez62Zit7K4viDqCkd+Xg8ba2e9vF+stGo0xNU9ipDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:55:58.144834Z"},"content_sha256":"8ece4b2674e7b8426c78e47b7d8feabe39acf2fda9b0eb6e29587e960f4f1983","schema_version":"1.0","event_id":"sha256:8ece4b2674e7b8426c78e47b7d8feabe39acf2fda9b0eb6e29587e960f4f1983"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZUSDK7XWTJZKPE57OSZ7GJCMR/bundle.json","state_url":"https://pith.science/pith/5ZUSDK7XWTJZKPE57OSZ7GJCMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZUSDK7XWTJZKPE57OSZ7GJCMR/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-26T17:55:58Z","links":{"resolver":"https://pith.science/pith/5ZUSDK7XWTJZKPE57OSZ7GJCMR","bundle":"https://pith.science/pith/5ZUSDK7XWTJZKPE57OSZ7GJCMR/bundle.json","state":"https://pith.science/pith/5ZUSDK7XWTJZKPE57OSZ7GJCMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZUSDK7XWTJZKPE57OSZ7GJCMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5ZUSDK7XWTJZKPE57OSZ7GJCMR","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":"00af18faa55d5a6385286026525a9f58b7955ee78199d329a592e222a8d826e8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2013-10-26T20:09:13Z","title_canon_sha256":"2f5d027c4faf40f2eff75a3edad5067dcc8e1a29bdae225cc01f1c3024b9e7fa"},"schema_version":"1.0","source":{"id":"1310.7890","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7890","created_at":"2026-05-18T03:08:27Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7890v1","created_at":"2026-05-18T03:08:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7890","created_at":"2026-05-18T03:08:27Z"},{"alias_kind":"pith_short_12","alias_value":"5ZUSDK7XWTJZ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5ZUSDK7XWTJZKPE5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5ZUSDK7X","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:8ece4b2674e7b8426c78e47b7d8feabe39acf2fda9b0eb6e29587e960f4f1983","target":"graph","created_at":"2026-05-18T03:08:27Z","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":"In this paper we are proposing a new sorting algorithm, List Sort algorithm, is based on the dynamic memory allocation. In this research study we have also shown the comparison of various efficient sorting techniques with List sort. Due the dynamic nature of the List sort, it becomes much more fast than some conventional comparison sorting techniques and comparable to Quick Sort and Merge Sort. List sort takes the advantage of the data which is already sorted either in ascending order or in descending order.","authors_text":"Adarsh Kumar Verma, Prashant Kumar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2013-10-26T20:09:13Z","title":"List Sort: A New Approach for Sorting List to Reduce Execution Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7890","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:6b95d0392426469ddc00f347617913fcb5d8b6730c329ae017aa6287ba49da02","target":"record","created_at":"2026-05-18T03:08:27Z","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":"00af18faa55d5a6385286026525a9f58b7955ee78199d329a592e222a8d826e8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2013-10-26T20:09:13Z","title_canon_sha256":"2f5d027c4faf40f2eff75a3edad5067dcc8e1a29bdae225cc01f1c3024b9e7fa"},"schema_version":"1.0","source":{"id":"1310.7890","kind":"arxiv","version":1}},"canonical_sha256":"ee6921abf7b4d3953c9dfba59f992264444f5c065242865acb1a6c49593fbf87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee6921abf7b4d3953c9dfba59f992264444f5c065242865acb1a6c49593fbf87","first_computed_at":"2026-05-18T03:08:27.715600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:27.715600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xKohFifbT37Bs/KNgbAPwUoMZJdBc6vpab8SMU2T/rDnEcxI5b4EkXtn2ltKF12VNiEfRZz3TKFObVARxlZSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:27.716260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7890","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b95d0392426469ddc00f347617913fcb5d8b6730c329ae017aa6287ba49da02","sha256:8ece4b2674e7b8426c78e47b7d8feabe39acf2fda9b0eb6e29587e960f4f1983"],"state_sha256":"0bc18aea24807831638ea6e960eb27c369edd375be6fbdc777cd6e87f26028ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hMoDp1w3syIM6/e7F2QQhzNQ2Orj38q30TB8TF6NFQcSQ4Q+d/kmQcTH0cSa3UbYrG3f01A2tlZ7kU8/tyqGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T17:55:58.146686Z","bundle_sha256":"92e0ce6da2b0355a9ed18f8aa7fa52af02f1898b6c46b62e8d22fc61b316c98e"}}