{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5B5LSD2FZPGWSIWJRFKHDQOYSF","short_pith_number":"pith:5B5LSD2F","schema_version":"1.0","canonical_sha256":"e87ab90f45cbcd6922c9895471c1d89156a97a9f8039bb9d4e3c9172fc72cb07","source":{"kind":"arxiv","id":"1503.01192","version":1},"attestation_state":"computed","paper":{"title":"Counting Inversions Adaptively","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry","submitted_at":"2015-03-04T01:50:20Z","abstract_excerpt":"We give a simple and efficient algorithm for adaptively counting inversions in a sequence of $n$ integers. Our algorithm runs in $O(n + n \\sqrt{\\lg{(Inv/n)}})$ time in the word-RAM model of computation, where $Inv$ is the number of inversions."},"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":"1503.01192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-04T01:50:20Z","cross_cats_sorted":[],"title_canon_sha256":"d7a19a2cba1c42deea91c59e7e976543d44b0cc92b71b0075408c773b57864e6","abstract_canon_sha256":"3a563e8aadc828e86dc3d336522f942c2534824f25eb7a058ba3b1eec50a3e64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:39.664260Z","signature_b64":"8kNw+jI4NceUQRTaNFwi4oPYz84sM8ZiGnyMqFPKFFa5jR2x//Ecv0l83N2uOz7E+Nk7TxAycw1fXwA20UAuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e87ab90f45cbcd6922c9895471c1d89156a97a9f8039bb9d4e3c9172fc72cb07","last_reissued_at":"2026-05-18T02:25:39.663815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:39.663815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Inversions Adaptively","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry","submitted_at":"2015-03-04T01:50:20Z","abstract_excerpt":"We give a simple and efficient algorithm for adaptively counting inversions in a sequence of $n$ integers. Our algorithm runs in $O(n + n \\sqrt{\\lg{(Inv/n)}})$ time in the word-RAM model of computation, where $Inv$ is the number of inversions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01192","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":"1503.01192","created_at":"2026-05-18T02:25:39.663887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01192v1","created_at":"2026-05-18T02:25:39.663887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01192","created_at":"2026-05-18T02:25:39.663887+00:00"},{"alias_kind":"pith_short_12","alias_value":"5B5LSD2FZPGW","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5B5LSD2FZPGWSIWJ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5B5LSD2F","created_at":"2026-05-18T12:29:05.191682+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/5B5LSD2FZPGWSIWJRFKHDQOYSF","json":"https://pith.science/pith/5B5LSD2FZPGWSIWJRFKHDQOYSF.json","graph_json":"https://pith.science/api/pith-number/5B5LSD2FZPGWSIWJRFKHDQOYSF/graph.json","events_json":"https://pith.science/api/pith-number/5B5LSD2FZPGWSIWJRFKHDQOYSF/events.json","paper":"https://pith.science/paper/5B5LSD2F"},"agent_actions":{"view_html":"https://pith.science/pith/5B5LSD2FZPGWSIWJRFKHDQOYSF","download_json":"https://pith.science/pith/5B5LSD2FZPGWSIWJRFKHDQOYSF.json","view_paper":"https://pith.science/paper/5B5LSD2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01192&json=true","fetch_graph":"https://pith.science/api/pith-number/5B5LSD2FZPGWSIWJRFKHDQOYSF/graph.json","fetch_events":"https://pith.science/api/pith-number/5B5LSD2FZPGWSIWJRFKHDQOYSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5B5LSD2FZPGWSIWJRFKHDQOYSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5B5LSD2FZPGWSIWJRFKHDQOYSF/action/storage_attestation","attest_author":"https://pith.science/pith/5B5LSD2FZPGWSIWJRFKHDQOYSF/action/author_attestation","sign_citation":"https://pith.science/pith/5B5LSD2FZPGWSIWJRFKHDQOYSF/action/citation_signature","submit_replication":"https://pith.science/pith/5B5LSD2FZPGWSIWJRFKHDQOYSF/action/replication_record"}},"created_at":"2026-05-18T02:25:39.663887+00:00","updated_at":"2026-05-18T02:25:39.663887+00:00"}