{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CKWNL2KD276E3PGGFJE5LMFSR2","short_pith_number":"pith:CKWNL2KD","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"},"canonical_sha256":"12acd5e943d7fc4dbcc62a49d5b0b28e81a63c8b6d0b67661b26fa2ff036d567","source":{"kind":"arxiv","id":"1612.08097","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08097","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08097v1","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08097","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"CKWNL2KD276E","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CKWNL2KD276E3PGG","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CKWNL2KD","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CKWNL2KD276E3PGGFJE5LMFSR2","target":"record","payload":{"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"},"canonical_sha256":"12acd5e943d7fc4dbcc62a49d5b0b28e81a63c8b6d0b67661b26fa2ff036d567","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"},"source_kind":"arxiv","source_id":"1612.08097","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-18T00:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"94q6ofQse3LAIsdu86VLVGcujGyy+0x34q4P3lwIdnnr6nB6a0sY63JXyelqIYiJ//9hvt0PFnJbj77gR0lWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:58:10.004805Z"},"content_sha256":"612b1e7289ad0d5885ddf2fd313b2f78e5cf437b19d10213dfe61fdd20715d87","schema_version":"1.0","event_id":"sha256:612b1e7289ad0d5885ddf2fd313b2f78e5cf437b19d10213dfe61fdd20715d87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CKWNL2KD276E3PGGFJE5LMFSR2","target":"graph","payload":{"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"},"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-18T00:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zuv5zEnsyu2cLs1fm4UEHu0czAFaa1h31ENAtLzMoCpkd2Y1nMz3hV6EqoyREC3GYRaEgH8QrIg5o1tBJqXFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:58:10.005147Z"},"content_sha256":"b726c0562068f26bcb89f3a284f5eefff0ceeb0cd2d5221dfb697ace41b1a031","schema_version":"1.0","event_id":"sha256:b726c0562068f26bcb89f3a284f5eefff0ceeb0cd2d5221dfb697ace41b1a031"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2/bundle.json","state_url":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKWNL2KD276E3PGGFJE5LMFSR2/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-21T21:58:10Z","links":{"resolver":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2","bundle":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2/bundle.json","state":"https://pith.science/pith/CKWNL2KD276E3PGGFJE5LMFSR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKWNL2KD276E3PGGFJE5LMFSR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CKWNL2KD276E3PGGFJE5LMFSR2","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":"a98b1efbd5648b6da500c92524a3865dcbd44290fd8fefed01c8dd3b463304cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T21:13:49Z","title_canon_sha256":"c81e179c92d117948ea892915f6213811967a3815dd90b02d9ad2417def86236"},"schema_version":"1.0","source":{"id":"1612.08097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08097","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08097v1","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08097","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"CKWNL2KD276E","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CKWNL2KD276E3PGG","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CKWNL2KD","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:b726c0562068f26bcb89f3a284f5eefff0ceeb0cd2d5221dfb697ace41b1a031","target":"graph","created_at":"2026-05-18T00:54:04Z","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":"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","authors_text":"Saladi Rahul","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T21:13:49Z","title":"New Results for Adaptive and Approximate Counting of Inversions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08097","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:612b1e7289ad0d5885ddf2fd313b2f78e5cf437b19d10213dfe61fdd20715d87","target":"record","created_at":"2026-05-18T00:54:04Z","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":"a98b1efbd5648b6da500c92524a3865dcbd44290fd8fefed01c8dd3b463304cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T21:13:49Z","title_canon_sha256":"c81e179c92d117948ea892915f6213811967a3815dd90b02d9ad2417def86236"},"schema_version":"1.0","source":{"id":"1612.08097","kind":"arxiv","version":1}},"canonical_sha256":"12acd5e943d7fc4dbcc62a49d5b0b28e81a63c8b6d0b67661b26fa2ff036d567","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12acd5e943d7fc4dbcc62a49d5b0b28e81a63c8b6d0b67661b26fa2ff036d567","first_computed_at":"2026-05-18T00:54:04.540232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:04.540232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pq8hh0Imjua00eGiW2FUh/0NCgK0Ulenb5QgfoDvUB3BnGPrqcZj5+3ZaLvzmsVfylkOGMl5F+xaT4iy4c+oBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:04.540615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:612b1e7289ad0d5885ddf2fd313b2f78e5cf437b19d10213dfe61fdd20715d87","sha256:b726c0562068f26bcb89f3a284f5eefff0ceeb0cd2d5221dfb697ace41b1a031"],"state_sha256":"f73b47bb92d1578c9e9cee3fc49965f3833c601052f6257a0090278b0d2bc220"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jYJMsMTK5BvIfny0cs8uVhlqxdKn55urZqK7tkuXzR5bGNT6tOJ3/w8OyyNQIjjNdLOI9De8nTdEx4/XrSr9Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:58:10.007102Z","bundle_sha256":"f5649b8034fd4550fb66a706555121316ee8c984151c71a833c5e50f1ae21e91"}}