{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZYM5S3FABRVF4BTN22GKV5GX3C","short_pith_number":"pith:ZYM5S3FA","schema_version":"1.0","canonical_sha256":"ce19d96ca00c6a5e066dd68caaf4d7d8a3a238a7e7a34cc2bb2ada8d5780f796","source":{"kind":"arxiv","id":"2606.00414","version":1},"attestation_state":"computed","paper":{"title":"Auditing Near-Optimal Policies Can Be Exponentially Hard: Conditional Query Lower Bounds via Occupancy Rashomon Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anuj Sharma, Ibne Farabi Shihab, Sanjeda Akter","submitted_at":"2026-05-29T23:09:01Z","abstract_excerpt":"When many reinforcement-learning policies achieve near-optimal return, a post-hoc auditor may have to distinguish among many behaviorally distinct but return-equivalent policies. We formalize this phenomenon through an occupancy-measure analogue of Rashomon capacity: the metric entropy of the near-optimal occupancy region, computed relative to an audited deployment class. Because occupancy measures identify behavior only up to occupancy equivalence, we formulate auditing at the occupancy-class level and distinguish exact local-query oracles from noisy sample-query oracles. Our main exact-query"},"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":"2606.00414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T23:09:01Z","cross_cats_sorted":[],"title_canon_sha256":"2df8ca2afa07b17edf67b16ed7e7baeb7f7ded56c308ada26489395b9e09eff6","abstract_canon_sha256":"f7a10cc44037f95b9d0418f8f2926278c28a96e6765c940f17a2025ebadc246b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:53.938414Z","signature_b64":"Hx9XmQ7njBYX+wVtF/2N/wAusbWgRe0XpeiLX6RlPmyPRxkNyjY65RV6ZG5uU+Gy4iObxnOIDRW3SOhLuSezDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce19d96ca00c6a5e066dd68caaf4d7d8a3a238a7e7a34cc2bb2ada8d5780f796","last_reissued_at":"2026-06-02T01:03:53.938039Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:53.938039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Auditing Near-Optimal Policies Can Be Exponentially Hard: Conditional Query Lower Bounds via Occupancy Rashomon Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anuj Sharma, Ibne Farabi Shihab, Sanjeda Akter","submitted_at":"2026-05-29T23:09:01Z","abstract_excerpt":"When many reinforcement-learning policies achieve near-optimal return, a post-hoc auditor may have to distinguish among many behaviorally distinct but return-equivalent policies. We formalize this phenomenon through an occupancy-measure analogue of Rashomon capacity: the metric entropy of the near-optimal occupancy region, computed relative to an audited deployment class. Because occupancy measures identify behavior only up to occupancy equivalence, we formulate auditing at the occupancy-class level and distinguish exact local-query oracles from noisy sample-query oracles. Our main exact-query"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00414","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.00414/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":"2606.00414","created_at":"2026-06-02T01:03:53.938087+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00414v1","created_at":"2026-06-02T01:03:53.938087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00414","created_at":"2026-06-02T01:03:53.938087+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYM5S3FABRVF","created_at":"2026-06-02T01:03:53.938087+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYM5S3FABRVF4BTN","created_at":"2026-06-02T01:03:53.938087+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYM5S3FA","created_at":"2026-06-02T01:03:53.938087+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/ZYM5S3FABRVF4BTN22GKV5GX3C","json":"https://pith.science/pith/ZYM5S3FABRVF4BTN22GKV5GX3C.json","graph_json":"https://pith.science/api/pith-number/ZYM5S3FABRVF4BTN22GKV5GX3C/graph.json","events_json":"https://pith.science/api/pith-number/ZYM5S3FABRVF4BTN22GKV5GX3C/events.json","paper":"https://pith.science/paper/ZYM5S3FA"},"agent_actions":{"view_html":"https://pith.science/pith/ZYM5S3FABRVF4BTN22GKV5GX3C","download_json":"https://pith.science/pith/ZYM5S3FABRVF4BTN22GKV5GX3C.json","view_paper":"https://pith.science/paper/ZYM5S3FA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00414&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYM5S3FABRVF4BTN22GKV5GX3C/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYM5S3FABRVF4BTN22GKV5GX3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYM5S3FABRVF4BTN22GKV5GX3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYM5S3FABRVF4BTN22GKV5GX3C/action/storage_attestation","attest_author":"https://pith.science/pith/ZYM5S3FABRVF4BTN22GKV5GX3C/action/author_attestation","sign_citation":"https://pith.science/pith/ZYM5S3FABRVF4BTN22GKV5GX3C/action/citation_signature","submit_replication":"https://pith.science/pith/ZYM5S3FABRVF4BTN22GKV5GX3C/action/replication_record"}},"created_at":"2026-06-02T01:03:53.938087+00:00","updated_at":"2026-06-02T01:03:53.938087+00:00"}