{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CKWNL2KD276E3PGGFJE5LMFSR2","short_pith_number":"pith:CKWNL2KD","schema_version":"1.0","canonical_sha256":"12acd5e943d7fc4dbcc62a49d5b0b28e81a63c8b6d0b67661b26fa2ff036d567","source":{"kind":"arxiv","id":"1612.08097","version":1},"attestation_state":"computed","paper":{"title":"New Results for Adaptive and Approximate Counting of Inversions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Saladi Rahul","submitted_at":"2016-12-23T21:13:49Z","abstract_excerpt":"Counting inversions is a classic and important problem in databases. The number of inversions, $K^*$, in a list $L=(L(1),L(2),\\ldots,L(n))$ is defined as the number of pairs $i < j$ with $L(i) > L(j)$. In this paper, new results for this problem are presented:\n  (1) In the I/O-model, an adaptive algorithm is presented for calculating $K^{*}$. The algorithm performs $O(\\frac{N}{B}+ \\frac{N}{B}\\log_{M/B}(\\frac{K^*}{NB}))$ I/Os. When $K^{*}=O(NM)$, then the algorithm takes only $O(\\frac{N}{B})$ I/Os. This algorithm can be modified to match the state of the art for the comparison based model and t"},"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":"1612.08097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T21:13:49Z","cross_cats_sorted":[],"title_canon_sha256":"c81e179c92d117948ea892915f6213811967a3815dd90b02d9ad2417def86236","abstract_canon_sha256":"a98b1efbd5648b6da500c92524a3865dcbd44290fd8fefed01c8dd3b463304cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:04.540615Z","signature_b64":"Pq8hh0Imjua00eGiW2FUh/0NCgK0Ulenb5QgfoDvUB3BnGPrqcZj5+3ZaLvzmsVfylkOGMl5F+xaT4iy4c+oBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12acd5e943d7fc4dbcc62a49d5b0b28e81a63c8b6d0b67661b26fa2ff036d567","last_reissued_at":"2026-05-18T00:54:04.540232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:04.540232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Results for Adaptive and Approximate Counting of Inversions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Saladi Rahul","submitted_at":"2016-12-23T21:13:49Z","abstract_excerpt":"Counting inversions is a classic and important problem in databases. The number of inversions, $K^*$, in a list $L=(L(1),L(2),\\ldots,L(n))$ is defined as the number of pairs $i < j$ with $L(i) > L(j)$. In this paper, new results for this problem are presented:\n  (1) In the I/O-model, an adaptive algorithm is presented for calculating $K^{*}$. The algorithm performs $O(\\frac{N}{B}+ \\frac{N}{B}\\log_{M/B}(\\frac{K^*}{NB}))$ I/Os. When $K^{*}=O(NM)$, then the algorithm takes only $O(\\frac{N}{B})$ I/Os. This algorithm can be modified to match the state of the art for the comparison based model and t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08097","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":"1612.08097","created_at":"2026-05-18T00:54:04.540288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.08097v1","created_at":"2026-05-18T00:54:04.540288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08097","created_at":"2026-05-18T00:54:04.540288+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKWNL2KD276E","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKWNL2KD276E3PGG","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKWNL2KD","created_at":"2026-05-18T12:30:09.641336+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/CKWNL2KD276E3PGGFJE5LMFSR2","json":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2.json","graph_json":"https://pith.science/api/pith-number/CKWNL2KD276E3PGGFJE5LMFSR2/graph.json","events_json":"https://pith.science/api/pith-number/CKWNL2KD276E3PGGFJE5LMFSR2/events.json","paper":"https://pith.science/paper/CKWNL2KD"},"agent_actions":{"view_html":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2","download_json":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2.json","view_paper":"https://pith.science/paper/CKWNL2KD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.08097&json=true","fetch_graph":"https://pith.science/api/pith-number/CKWNL2KD276E3PGGFJE5LMFSR2/graph.json","fetch_events":"https://pith.science/api/pith-number/CKWNL2KD276E3PGGFJE5LMFSR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2/action/storage_attestation","attest_author":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2/action/author_attestation","sign_citation":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2/action/citation_signature","submit_replication":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2/action/replication_record"}},"created_at":"2026-05-18T00:54:04.540288+00:00","updated_at":"2026-05-18T00:54:04.540288+00:00"}