{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7HLPEAD34HJTH4EYR2SQIS5CFZ","short_pith_number":"pith:7HLPEAD3","canonical_record":{"source":{"id":"1709.08985","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-26T12:53:50Z","cross_cats_sorted":[],"title_canon_sha256":"0997ac8ef3bec411cbe518af92ccbeaeddd6ff0e17815da2841e933ce0d020c7","abstract_canon_sha256":"7bca0c3ef8c01dcff94d7710cbc3eef1d48b864ae1bfdf85c608c520eb164073"},"schema_version":"1.0"},"canonical_sha256":"f9d6f2007be1d333f0988ea5044ba22e611aff2aa2e7f4bf4c03cf2f553e0681","source":{"kind":"arxiv","id":"1709.08985","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08985","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08985v3","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08985","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"7HLPEAD34HJT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7HLPEAD34HJTH4EY","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7HLPEAD3","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7HLPEAD34HJTH4EYR2SQIS5CFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08985","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-26T12:53:50Z","cross_cats_sorted":[],"title_canon_sha256":"0997ac8ef3bec411cbe518af92ccbeaeddd6ff0e17815da2841e933ce0d020c7","abstract_canon_sha256":"7bca0c3ef8c01dcff94d7710cbc3eef1d48b864ae1bfdf85c608c520eb164073"},"schema_version":"1.0"},"canonical_sha256":"f9d6f2007be1d333f0988ea5044ba22e611aff2aa2e7f4bf4c03cf2f553e0681","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:10.204725Z","signature_b64":"Y0427kFjdEIbzNQ9wnuKSVklcKiPMsMCBJXAe7CaEEOjmdoHDk91abdS7A4GJah3sWw3A9S/gF3whigmOS+TAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9d6f2007be1d333f0988ea5044ba22e611aff2aa2e7f4bf4c03cf2f553e0681","last_reissued_at":"2026-05-18T00:01:10.204163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:10.204163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08985","source_version":3,"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:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXh4k8XOh4r683Y+Hihi/fc/3N/RyPVB/D0xpfcA7u4IhoPSmPRZrJmp2A5q6/3sMudPRPc3nTKvBAzEGp77Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:07:43.593813Z"},"content_sha256":"62617325500386a972a2a2df21b145448d48d9eb8caa674999e6756225dd4bde","schema_version":"1.0","event_id":"sha256:62617325500386a972a2a2df21b145448d48d9eb8caa674999e6756225dd4bde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7HLPEAD34HJTH4EYR2SQIS5CFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"All Classical Adversary Methods are Equivalent for Total Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aleksejs Zajakins, Andris Ambainis, Jevg\\=enijs Vihrovs, Kri\\v{s}j\\=anis Pr\\=usis, Martins Kokainis","submitted_at":"2017-09-26T12:53:50Z","abstract_excerpt":"We show that all known classical adversary lower bounds on randomized query complexity are equivalent for total functions, and are equal to the fractional block sensitivity $\\text{fbs}(f)$. That includes the Kolmogorov complexity bound of Laplante and Magniez and the earlier relational adversary bound of Aaronson. This equivalence also implies that for total functions, the relational adversary is equivalent to a simpler lower bound, which we call rank-1 relational adversary. For partial functions, we show unbounded separations between $\\text{fbs}(f)$ and other adversary bounds, as well as betw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08985","kind":"arxiv","version":3},"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:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mjoKX4DB0GEC8XCvQyDq30B7Z7Hh3NXp1ZkND+zaA5J16MvY1kSHkYJ1uvxXolS4Ws0ISzo3T5sE7zo+LWJzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:07:43.594470Z"},"content_sha256":"67bb91fde9683cc7bae67783f4ad00ecfdd8e336fe1569a9d577b68af5402d39","schema_version":"1.0","event_id":"sha256:67bb91fde9683cc7bae67783f4ad00ecfdd8e336fe1569a9d577b68af5402d39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HLPEAD34HJTH4EYR2SQIS5CFZ/bundle.json","state_url":"https://pith.science/pith/7HLPEAD34HJTH4EYR2SQIS5CFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HLPEAD34HJTH4EYR2SQIS5CFZ/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-05-25T11:07:43Z","links":{"resolver":"https://pith.science/pith/7HLPEAD34HJTH4EYR2SQIS5CFZ","bundle":"https://pith.science/pith/7HLPEAD34HJTH4EYR2SQIS5CFZ/bundle.json","state":"https://pith.science/pith/7HLPEAD34HJTH4EYR2SQIS5CFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HLPEAD34HJTH4EYR2SQIS5CFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7HLPEAD34HJTH4EYR2SQIS5CFZ","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":"7bca0c3ef8c01dcff94d7710cbc3eef1d48b864ae1bfdf85c608c520eb164073","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-26T12:53:50Z","title_canon_sha256":"0997ac8ef3bec411cbe518af92ccbeaeddd6ff0e17815da2841e933ce0d020c7"},"schema_version":"1.0","source":{"id":"1709.08985","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08985","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08985v3","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08985","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"7HLPEAD34HJT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7HLPEAD34HJTH4EY","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7HLPEAD3","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:67bb91fde9683cc7bae67783f4ad00ecfdd8e336fe1569a9d577b68af5402d39","target":"graph","created_at":"2026-05-18T00:01:10Z","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":"We show that all known classical adversary lower bounds on randomized query complexity are equivalent for total functions, and are equal to the fractional block sensitivity $\\text{fbs}(f)$. That includes the Kolmogorov complexity bound of Laplante and Magniez and the earlier relational adversary bound of Aaronson. This equivalence also implies that for total functions, the relational adversary is equivalent to a simpler lower bound, which we call rank-1 relational adversary. For partial functions, we show unbounded separations between $\\text{fbs}(f)$ and other adversary bounds, as well as betw","authors_text":"Aleksejs Zajakins, Andris Ambainis, Jevg\\=enijs Vihrovs, Kri\\v{s}j\\=anis Pr\\=usis, Martins Kokainis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-26T12:53:50Z","title":"All Classical Adversary Methods are Equivalent for Total Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08985","kind":"arxiv","version":3},"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:62617325500386a972a2a2df21b145448d48d9eb8caa674999e6756225dd4bde","target":"record","created_at":"2026-05-18T00:01:10Z","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":"7bca0c3ef8c01dcff94d7710cbc3eef1d48b864ae1bfdf85c608c520eb164073","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-26T12:53:50Z","title_canon_sha256":"0997ac8ef3bec411cbe518af92ccbeaeddd6ff0e17815da2841e933ce0d020c7"},"schema_version":"1.0","source":{"id":"1709.08985","kind":"arxiv","version":3}},"canonical_sha256":"f9d6f2007be1d333f0988ea5044ba22e611aff2aa2e7f4bf4c03cf2f553e0681","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9d6f2007be1d333f0988ea5044ba22e611aff2aa2e7f4bf4c03cf2f553e0681","first_computed_at":"2026-05-18T00:01:10.204163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:10.204163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y0427kFjdEIbzNQ9wnuKSVklcKiPMsMCBJXAe7CaEEOjmdoHDk91abdS7A4GJah3sWw3A9S/gF3whigmOS+TAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:10.204725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08985","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62617325500386a972a2a2df21b145448d48d9eb8caa674999e6756225dd4bde","sha256:67bb91fde9683cc7bae67783f4ad00ecfdd8e336fe1569a9d577b68af5402d39"],"state_sha256":"8df779c000a7866fbc61f7fe3145e601a3d173c9b8198148fa13041da7a02294"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADGLjpa8oZvcaf46xS4LG3lMVDmC7z9GTYPxAsJaarlrnMP++FS45z6SgE9O9ihpJcjYBfuHwHd2YR6A6sC/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:07:43.597896Z","bundle_sha256":"3ee19a915218fdf65c752a9705aca39877c829ae04a6bf6014e439831f1a92bc"}}