{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:K5WVLTVPSBPDRNFOZYCETS3QD2","short_pith_number":"pith:K5WVLTVP","schema_version":"1.0","canonical_sha256":"576d55ceaf905e38b4aece0449cb701e92618c2a82c2dd470fec2ceb99162f7c","source":{"kind":"arxiv","id":"2601.18747","version":2},"attestation_state":"computed","paper":{"title":"The $\\mathbf{P}$-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","cs.CL","cs.DB"],"primary_cat":"cs.IR","authors_text":"Amir Aavani","submitted_at":"2026-01-26T18:07:40Z","abstract_excerpt":"Modern AI agents increasingly rely on search infrastructure to execute complex, neuro-symbolic reasoning workflows. These workflows often compile into deeply nested, non-monotonic Boolean queries over text fields. However, standard query evaluation strategies over inverted indices face severe theoretical limits when handling these structures. Stateful iterator models (Document-at-a-Time) are structurally bounded by $\\text{NC}^1$ formula evaluation, suffering a worst-case $O(2^{|Q|})$ exponential blowup in query complexity when unrolling re-convergent logic. Conversely, recursive materializatio"},"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":"2601.18747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-01-26T18:07:40Z","cross_cats_sorted":["cs.AI","cs.CC","cs.CL","cs.DB"],"title_canon_sha256":"7904d95b4b3b1ba16fca67be4c0144dd6519696d24bb897f4655e7c8944c4a3a","abstract_canon_sha256":"16a767442effb71b9d4d10bc13f4c2152dd46f4c9a254b0f4825482295c656ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:25.124016Z","signature_b64":"O/d7tVv9eB96PlNJyfEK3VDNB8wxEtJ5QRGIiHQ96Qt/yL/rLrYGOzvU7IFn8+yTmziezi7Djk+eHihQToRWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"576d55ceaf905e38b4aece0449cb701e92618c2a82c2dd470fec2ceb99162f7c","last_reissued_at":"2026-06-24T01:14:25.123445Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:25.123445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $\\mathbf{P}$-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","cs.CL","cs.DB"],"primary_cat":"cs.IR","authors_text":"Amir Aavani","submitted_at":"2026-01-26T18:07:40Z","abstract_excerpt":"Modern AI agents increasingly rely on search infrastructure to execute complex, neuro-symbolic reasoning workflows. These workflows often compile into deeply nested, non-monotonic Boolean queries over text fields. However, standard query evaluation strategies over inverted indices face severe theoretical limits when handling these structures. Stateful iterator models (Document-at-a-Time) are structurally bounded by $\\text{NC}^1$ formula evaluation, suffering a worst-case $O(2^{|Q|})$ exponential blowup in query complexity when unrolling re-convergent logic. Conversely, recursive materializatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.18747","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.18747/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2601.18747","created_at":"2026-06-24T01:14:25.123507+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.18747v2","created_at":"2026-06-24T01:14:25.123507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.18747","created_at":"2026-06-24T01:14:25.123507+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5WVLTVPSBPD","created_at":"2026-06-24T01:14:25.123507+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5WVLTVPSBPDRNFO","created_at":"2026-06-24T01:14:25.123507+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5WVLTVP","created_at":"2026-06-24T01:14:25.123507+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/K5WVLTVPSBPDRNFOZYCETS3QD2","json":"https://pith.science/pith/K5WVLTVPSBPDRNFOZYCETS3QD2.json","graph_json":"https://pith.science/api/pith-number/K5WVLTVPSBPDRNFOZYCETS3QD2/graph.json","events_json":"https://pith.science/api/pith-number/K5WVLTVPSBPDRNFOZYCETS3QD2/events.json","paper":"https://pith.science/paper/K5WVLTVP"},"agent_actions":{"view_html":"https://pith.science/pith/K5WVLTVPSBPDRNFOZYCETS3QD2","download_json":"https://pith.science/pith/K5WVLTVPSBPDRNFOZYCETS3QD2.json","view_paper":"https://pith.science/paper/K5WVLTVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.18747&json=true","fetch_graph":"https://pith.science/api/pith-number/K5WVLTVPSBPDRNFOZYCETS3QD2/graph.json","fetch_events":"https://pith.science/api/pith-number/K5WVLTVPSBPDRNFOZYCETS3QD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5WVLTVPSBPDRNFOZYCETS3QD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5WVLTVPSBPDRNFOZYCETS3QD2/action/storage_attestation","attest_author":"https://pith.science/pith/K5WVLTVPSBPDRNFOZYCETS3QD2/action/author_attestation","sign_citation":"https://pith.science/pith/K5WVLTVPSBPDRNFOZYCETS3QD2/action/citation_signature","submit_replication":"https://pith.science/pith/K5WVLTVPSBPDRNFOZYCETS3QD2/action/replication_record"}},"created_at":"2026-06-24T01:14:25.123507+00:00","updated_at":"2026-06-24T01:14:25.123507+00:00"}