{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LM7HFTCU46UAO6ZLTALADDI3M5","short_pith_number":"pith:LM7HFTCU","canonical_record":{"source":{"id":"1407.5111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-18T20:38:18Z","cross_cats_sorted":[],"title_canon_sha256":"586f446ba1c757d7a0b2f669b7a7eb5988133e0e762a3563abb666866618be2b","abstract_canon_sha256":"76e1dd8e0a5859a54e0ce4b0a02872e2145bf7a4e69897280644105000024823"},"schema_version":"1.0"},"canonical_sha256":"5b3e72cc54e7a8077b2b9816018d1b675b8315528727a7f6ca0fc432d6ea369c","source":{"kind":"arxiv","id":"1407.5111","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5111","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5111v2","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5111","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"LM7HFTCU46UA","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LM7HFTCU46UAO6ZL","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LM7HFTCU","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LM7HFTCU46UAO6ZLTALADDI3M5","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-18T20:38:18Z","cross_cats_sorted":[],"title_canon_sha256":"586f446ba1c757d7a0b2f669b7a7eb5988133e0e762a3563abb666866618be2b","abstract_canon_sha256":"76e1dd8e0a5859a54e0ce4b0a02872e2145bf7a4e69897280644105000024823"},"schema_version":"1.0"},"canonical_sha256":"5b3e72cc54e7a8077b2b9816018d1b675b8315528727a7f6ca0fc432d6ea369c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:06.940346Z","signature_b64":"R4RviXrp/1JbjdfLhIvNib6dpiszjqZVIktnH7DJSnWwy3LtQQi1xgC/oiM7J8t/7ge6wWWILP9MFA9fgPGtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b3e72cc54e7a8077b2b9816018d1b675b8315528727a7f6ca0fc432d6ea369c","last_reissued_at":"2026-05-18T02:47:06.939910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:06.939910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5111","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:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FKxhwyeWTLKlI4E6L1XptS3reG5/lKARTDCcig0tAM8E3A/8ymWV+5XxJ/ELcDDH3WCk8FTxDtAndXXSKktNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:24:37.095537Z"},"content_sha256":"67fc775a54f5642451addd23afa350754ffd83964ed2565e1a337ee93dbc1c68","schema_version":"1.0","event_id":"sha256:67fc775a54f5642451addd23afa350754ffd83964ed2565e1a337ee93dbc1c68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LM7HFTCU46UAO6ZLTALADDI3M5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design and Analysis of RS Sort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Harsh Ranjan, Niraj Kumar Singh, Sumit Agarwal","submitted_at":"2014-07-18T20:38:18Z","abstract_excerpt":"This paper introduces a new comparison base stable sorting algorithm, named RS sort. RS Sort involves only the comparison of pair of elements in an array which ultimately sorts the array and does not involve the comparison of each element with every other element. RS sort tries to build upon the relationship established between the elements in each pass. Suppose there is an array containing three elements a1, a2, a3 and if a relationship exist such that a1<a2 and a2<a3 then it can be established that a1<a3 and so there is no need to compare a1 and a3. Sorting is a fundamental operation in comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5111","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:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PnJIGfjHLz4ow3TCcaiRkRAl5LrKLW4xeMwdYJ+jGreOlRHH610M2CglAAfV7oDiNYFIjCKRf63i/UouymshCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:24:37.095910Z"},"content_sha256":"4b6dbf63b39cdaa13a6dda326469795289ec639e58137253c6a7aabbbb3a578c","schema_version":"1.0","event_id":"sha256:4b6dbf63b39cdaa13a6dda326469795289ec639e58137253c6a7aabbbb3a578c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LM7HFTCU46UAO6ZLTALADDI3M5/bundle.json","state_url":"https://pith.science/pith/LM7HFTCU46UAO6ZLTALADDI3M5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LM7HFTCU46UAO6ZLTALADDI3M5/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-24T18:24:37Z","links":{"resolver":"https://pith.science/pith/LM7HFTCU46UAO6ZLTALADDI3M5","bundle":"https://pith.science/pith/LM7HFTCU46UAO6ZLTALADDI3M5/bundle.json","state":"https://pith.science/pith/LM7HFTCU46UAO6ZLTALADDI3M5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LM7HFTCU46UAO6ZLTALADDI3M5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LM7HFTCU46UAO6ZLTALADDI3M5","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":"76e1dd8e0a5859a54e0ce4b0a02872e2145bf7a4e69897280644105000024823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-18T20:38:18Z","title_canon_sha256":"586f446ba1c757d7a0b2f669b7a7eb5988133e0e762a3563abb666866618be2b"},"schema_version":"1.0","source":{"id":"1407.5111","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5111","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5111v2","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5111","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"LM7HFTCU46UA","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LM7HFTCU46UAO6ZL","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LM7HFTCU","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:4b6dbf63b39cdaa13a6dda326469795289ec639e58137253c6a7aabbbb3a578c","target":"graph","created_at":"2026-05-18T02:47:06Z","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":"This paper introduces a new comparison base stable sorting algorithm, named RS sort. RS Sort involves only the comparison of pair of elements in an array which ultimately sorts the array and does not involve the comparison of each element with every other element. RS sort tries to build upon the relationship established between the elements in each pass. Suppose there is an array containing three elements a1, a2, a3 and if a relationship exist such that a1<a2 and a2<a3 then it can be established that a1<a3 and so there is no need to compare a1 and a3. Sorting is a fundamental operation in comp","authors_text":"Harsh Ranjan, Niraj Kumar Singh, Sumit Agarwal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-18T20:38:18Z","title":"Design and Analysis of RS Sort"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5111","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:67fc775a54f5642451addd23afa350754ffd83964ed2565e1a337ee93dbc1c68","target":"record","created_at":"2026-05-18T02:47:06Z","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":"76e1dd8e0a5859a54e0ce4b0a02872e2145bf7a4e69897280644105000024823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-18T20:38:18Z","title_canon_sha256":"586f446ba1c757d7a0b2f669b7a7eb5988133e0e762a3563abb666866618be2b"},"schema_version":"1.0","source":{"id":"1407.5111","kind":"arxiv","version":2}},"canonical_sha256":"5b3e72cc54e7a8077b2b9816018d1b675b8315528727a7f6ca0fc432d6ea369c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b3e72cc54e7a8077b2b9816018d1b675b8315528727a7f6ca0fc432d6ea369c","first_computed_at":"2026-05-18T02:47:06.939910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:06.939910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R4RviXrp/1JbjdfLhIvNib6dpiszjqZVIktnH7DJSnWwy3LtQQi1xgC/oiM7J8t/7ge6wWWILP9MFA9fgPGtDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:06.940346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5111","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67fc775a54f5642451addd23afa350754ffd83964ed2565e1a337ee93dbc1c68","sha256:4b6dbf63b39cdaa13a6dda326469795289ec639e58137253c6a7aabbbb3a578c"],"state_sha256":"c2892cfce37565207f5a55cf4af6d84e60d6d30a8bc3d8d3f1b2c2a02a8adebe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2SCv9lqPDw7wwXMtweykzfQYAA60BE/AteKFbbbn+iacCI/lIGTpzenFX3Sy91x/n+GlFnXDWpTrFYEjvpoUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:24:37.097848Z","bundle_sha256":"928eac3681d2537f9f133f7a9915e57615cfc6320d4566f7ea7787ed24dac56d"}}