{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BPWTUIRKC4NXOZ3J47VXZOCV35","short_pith_number":"pith:BPWTUIRK","schema_version":"1.0","canonical_sha256":"0bed3a222a171b776769e7eb7cb855df773fe6ee00ffae59b4c41ec583df8e85","source":{"kind":"arxiv","id":"2405.18155","version":1},"attestation_state":"computed","paper":{"title":"On Bounded Advice Classes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Casper Gyurik, Simon Marshall, Vedran Dunjko","submitted_at":"2024-05-28T13:16:10Z","abstract_excerpt":"Advice classes in computational complexity have frequently been used to model real-world scenarios encountered in cryptography, quantum computing and machine learning, where some computational task may be broken down into a preprocessing and deployment phase, each associated with a different complexity. However, in these scenarios, the advice given by the preprocessing phase must still be generated by some (albeit more powerful) bounded machine, which is not the case in conventional advice classes. To better model these cases we develop `bounded advice classes', where a more powerful Turing ma"},"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":"2405.18155","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2024-05-28T13:16:10Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"ea3e6af6a3ae6651ed8b1bdfa731c92a0453018ef0de928f6ef65f69816c251e","abstract_canon_sha256":"27c5c504d6febdc779d217e69261aef80e8f3a7eb6ad2693623d0c10a07d7980"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:16.374304Z","signature_b64":"DNFTAqzMenjzbT7eQdM1j8wyNjfaY1gUpZbKIMoeExQ81rTgquLdf3zBVueBb/GRWHeEMZOi+BqWFMOksCDpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bed3a222a171b776769e7eb7cb855df773fe6ee00ffae59b4c41ec583df8e85","last_reissued_at":"2026-07-05T08:24:16.373814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:16.373814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Bounded Advice Classes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Casper Gyurik, Simon Marshall, Vedran Dunjko","submitted_at":"2024-05-28T13:16:10Z","abstract_excerpt":"Advice classes in computational complexity have frequently been used to model real-world scenarios encountered in cryptography, quantum computing and machine learning, where some computational task may be broken down into a preprocessing and deployment phase, each associated with a different complexity. However, in these scenarios, the advice given by the preprocessing phase must still be generated by some (albeit more powerful) bounded machine, which is not the case in conventional advice classes. To better model these cases we develop `bounded advice classes', where a more powerful Turing ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18155","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/2405.18155/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":"2405.18155","created_at":"2026-07-05T08:24:16.373885+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.18155v1","created_at":"2026-07-05T08:24:16.373885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18155","created_at":"2026-07-05T08:24:16.373885+00:00"},{"alias_kind":"pith_short_12","alias_value":"BPWTUIRKC4NX","created_at":"2026-07-05T08:24:16.373885+00:00"},{"alias_kind":"pith_short_16","alias_value":"BPWTUIRKC4NXOZ3J","created_at":"2026-07-05T08:24:16.373885+00:00"},{"alias_kind":"pith_short_8","alias_value":"BPWTUIRK","created_at":"2026-07-05T08:24:16.373885+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/BPWTUIRKC4NXOZ3J47VXZOCV35","json":"https://pith.science/pith/BPWTUIRKC4NXOZ3J47VXZOCV35.json","graph_json":"https://pith.science/api/pith-number/BPWTUIRKC4NXOZ3J47VXZOCV35/graph.json","events_json":"https://pith.science/api/pith-number/BPWTUIRKC4NXOZ3J47VXZOCV35/events.json","paper":"https://pith.science/paper/BPWTUIRK"},"agent_actions":{"view_html":"https://pith.science/pith/BPWTUIRKC4NXOZ3J47VXZOCV35","download_json":"https://pith.science/pith/BPWTUIRKC4NXOZ3J47VXZOCV35.json","view_paper":"https://pith.science/paper/BPWTUIRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.18155&json=true","fetch_graph":"https://pith.science/api/pith-number/BPWTUIRKC4NXOZ3J47VXZOCV35/graph.json","fetch_events":"https://pith.science/api/pith-number/BPWTUIRKC4NXOZ3J47VXZOCV35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BPWTUIRKC4NXOZ3J47VXZOCV35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BPWTUIRKC4NXOZ3J47VXZOCV35/action/storage_attestation","attest_author":"https://pith.science/pith/BPWTUIRKC4NXOZ3J47VXZOCV35/action/author_attestation","sign_citation":"https://pith.science/pith/BPWTUIRKC4NXOZ3J47VXZOCV35/action/citation_signature","submit_replication":"https://pith.science/pith/BPWTUIRKC4NXOZ3J47VXZOCV35/action/replication_record"}},"created_at":"2026-07-05T08:24:16.373885+00:00","updated_at":"2026-07-05T08:24:16.373885+00:00"}