{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DIZ2RM2XGTUSKKN24U27XED73R","short_pith_number":"pith:DIZ2RM2X","schema_version":"1.0","canonical_sha256":"1a33a8b35734e92529bae535fb907fdc66f4bd78816c3ac0579135db881b9526","source":{"kind":"arxiv","id":"1202.5957","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Complexity on a New Sorting Algorithm: A Study in Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.CO","authors_text":"Anchala Kumari, Prashant Kumar, Soubhik Chakraborty","submitted_at":"2012-02-27T14:45:46Z","abstract_excerpt":"Sundararajan and Chakraborty (2007) introduced a new sorting algorithm by modifying the fast and popular Quick sort and removing the interchanges. In a subsequent empirical study, Sourabh, Sundararajan and Chakraborty (2007) demonstrated that this algorithm sorts inputs from certain probability distributions faster than others and the authors made a list of some standard probability distributions in decreasing order of speed, namely, Continuous uniform < Discrete uniform < Binomial < Negative Binomial < Poisson < Geometric < Exponential < Standard Normal. It is clear from this interesting seco"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1202.5957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2012-02-27T14:45:46Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9d9324633fa10c191818f4c53078b500e40373fdceebe8cfd6b6926bf17938a5","abstract_canon_sha256":"e4597daa274038bdfedaf24c7bd01dbb3e8ae047d770d188554705b0c74e7455"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:24.215001Z","signature_b64":"+wuH4jMv5AWAEXXxHc4xtnN9lt+EAkpQ7+V+xQcElV6jkNH8LKPn3DdhJtAqXANfn17FM5LSv0mmuQML+qXUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a33a8b35734e92529bae535fb907fdc66f4bd78816c3ac0579135db881b9526","last_reissued_at":"2026-05-18T04:01:24.214285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:24.214285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity on a New Sorting Algorithm: A Study in Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.CO","authors_text":"Anchala Kumari, Prashant Kumar, Soubhik Chakraborty","submitted_at":"2012-02-27T14:45:46Z","abstract_excerpt":"Sundararajan and Chakraborty (2007) introduced a new sorting algorithm by modifying the fast and popular Quick sort and removing the interchanges. In a subsequent empirical study, Sourabh, Sundararajan and Chakraborty (2007) demonstrated that this algorithm sorts inputs from certain probability distributions faster than others and the authors made a list of some standard probability distributions in decreasing order of speed, namely, Continuous uniform < Discrete uniform < Binomial < Negative Binomial < Poisson < Geometric < Exponential < Standard Normal. It is clear from this interesting seco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5957","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.5957","created_at":"2026-05-18T04:01:24.214409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5957v1","created_at":"2026-05-18T04:01:24.214409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5957","created_at":"2026-05-18T04:01:24.214409+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIZ2RM2XGTUS","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIZ2RM2XGTUSKKN2","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIZ2RM2X","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DIZ2RM2XGTUSKKN24U27XED73R","json":"https://pith.science/pith/DIZ2RM2XGTUSKKN24U27XED73R.json","graph_json":"https://pith.science/api/pith-number/DIZ2RM2XGTUSKKN24U27XED73R/graph.json","events_json":"https://pith.science/api/pith-number/DIZ2RM2XGTUSKKN24U27XED73R/events.json","paper":"https://pith.science/paper/DIZ2RM2X"},"agent_actions":{"view_html":"https://pith.science/pith/DIZ2RM2XGTUSKKN24U27XED73R","download_json":"https://pith.science/pith/DIZ2RM2XGTUSKKN24U27XED73R.json","view_paper":"https://pith.science/paper/DIZ2RM2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5957&json=true","fetch_graph":"https://pith.science/api/pith-number/DIZ2RM2XGTUSKKN24U27XED73R/graph.json","fetch_events":"https://pith.science/api/pith-number/DIZ2RM2XGTUSKKN24U27XED73R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIZ2RM2XGTUSKKN24U27XED73R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIZ2RM2XGTUSKKN24U27XED73R/action/storage_attestation","attest_author":"https://pith.science/pith/DIZ2RM2XGTUSKKN24U27XED73R/action/author_attestation","sign_citation":"https://pith.science/pith/DIZ2RM2XGTUSKKN24U27XED73R/action/citation_signature","submit_replication":"https://pith.science/pith/DIZ2RM2XGTUSKKN24U27XED73R/action/replication_record"}},"created_at":"2026-05-18T04:01:24.214409+00:00","updated_at":"2026-05-18T04:01:24.214409+00:00"}