{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Q7263H6SJXYGUSPDM2BK3HFYDR","short_pith_number":"pith:Q7263H6S","canonical_record":{"source":{"id":"1309.6731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-26T06:42:13Z","cross_cats_sorted":[],"title_canon_sha256":"1b5180ae36c6ebb38b4e84a5a46d9ae1fc3a12bb517aee74fc8ae710c6a17087","abstract_canon_sha256":"141cd0731d9d42d0502760840e02e206063a3637e6205e1121b7fd7e218ca580"},"schema_version":"1.0"},"canonical_sha256":"87f5ed9fd24df06a49e36682ad9cb81c4eb761c6f38fed0fd592884ed5483625","source":{"kind":"arxiv","id":"1309.6731","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6731","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6731v2","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6731","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"Q7263H6SJXYG","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q7263H6SJXYGUSPD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q7263H6S","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Q7263H6SJXYGUSPDM2BK3HFYDR","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-26T06:42:13Z","cross_cats_sorted":[],"title_canon_sha256":"1b5180ae36c6ebb38b4e84a5a46d9ae1fc3a12bb517aee74fc8ae710c6a17087","abstract_canon_sha256":"141cd0731d9d42d0502760840e02e206063a3637e6205e1121b7fd7e218ca580"},"schema_version":"1.0"},"canonical_sha256":"87f5ed9fd24df06a49e36682ad9cb81c4eb761c6f38fed0fd592884ed5483625","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:43.947536Z","signature_b64":"0WRnGs4Y+u62ZCJWK4+hziPA16SyBqnSd2c5n0M3AR9WtPqPrjr/ivFj1BA5oKiJEOuoJdSRIEzO2wlYCEiCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87f5ed9fd24df06a49e36682ad9cb81c4eb761c6f38fed0fd592884ed5483625","last_reissued_at":"2026-05-18T02:56:43.947050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:43.947050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6731","source_version":2,"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-18T02:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Ilo9z3gFRk3JpcrO58GyWCixm/IzKPs59+fXQbdVNuOFMUb2vTYtbi3DER1mF2fzdLpW061/9b1HRd9p4wuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:52:52.886867Z"},"content_sha256":"20e9eb76383855300349e68a755f104904be009e2d4d807326e0dca0d00a1bee","schema_version":"1.0","event_id":"sha256:20e9eb76383855300349e68a755f104904be009e2d4d807326e0dca0d00a1bee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Q7263H6SJXYGUSPDM2BK3HFYDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Search Problems in Vector Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, Marcella Tak\\'ats, Tam\\'as H\\'eger","submitted_at":"2013-09-26T06:42:13Z","abstract_excerpt":"We consider the following $q$-analog of the basic combinatorial search problem: let $q$ be a prime power and $\\GF(q)$ the finite field of $q$ elements. Let $V$ denote an $n$-dimensional vector space over $\\GF(q)$ and let $\\mathbf{v}$ be an unknown 1-dimensional subspace of $V$. We will be interested in determining the minimum number of queries that is needed to find $\\mathbf{v}$ provided all queries are subspaces of $V$ and the answer to a query $U$ is YES if $\\mathbf{v} \\leqslant U$ and NO if $\\mathbf{v} \\not\\leqslant U$. This number will be denoted by $A(n,q)$ in the adaptive case (when for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6731","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":""},"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-18T02:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vD2HgT5FnoVJqL19hpXbt4RuyH+ecdk24OxeOWmp2YAh/8GgM7DFj1fem5PGrMO0kiDuWXJUTgMfnzO0hyvoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:52:52.887207Z"},"content_sha256":"01a5116df1d0c5ae82c5793d3eed8b5a17ab8f90d4edc276189390fd6ccda300","schema_version":"1.0","event_id":"sha256:01a5116df1d0c5ae82c5793d3eed8b5a17ab8f90d4edc276189390fd6ccda300"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7263H6SJXYGUSPDM2BK3HFYDR/bundle.json","state_url":"https://pith.science/pith/Q7263H6SJXYGUSPDM2BK3HFYDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7263H6SJXYGUSPDM2BK3HFYDR/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-06-02T06:52:52Z","links":{"resolver":"https://pith.science/pith/Q7263H6SJXYGUSPDM2BK3HFYDR","bundle":"https://pith.science/pith/Q7263H6SJXYGUSPDM2BK3HFYDR/bundle.json","state":"https://pith.science/pith/Q7263H6SJXYGUSPDM2BK3HFYDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7263H6SJXYGUSPDM2BK3HFYDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Q7263H6SJXYGUSPDM2BK3HFYDR","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":"141cd0731d9d42d0502760840e02e206063a3637e6205e1121b7fd7e218ca580","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-26T06:42:13Z","title_canon_sha256":"1b5180ae36c6ebb38b4e84a5a46d9ae1fc3a12bb517aee74fc8ae710c6a17087"},"schema_version":"1.0","source":{"id":"1309.6731","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6731","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6731v2","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6731","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"Q7263H6SJXYG","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q7263H6SJXYGUSPD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q7263H6S","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:01a5116df1d0c5ae82c5793d3eed8b5a17ab8f90d4edc276189390fd6ccda300","target":"graph","created_at":"2026-05-18T02:56:43Z","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 consider the following $q$-analog of the basic combinatorial search problem: let $q$ be a prime power and $\\GF(q)$ the finite field of $q$ elements. Let $V$ denote an $n$-dimensional vector space over $\\GF(q)$ and let $\\mathbf{v}$ be an unknown 1-dimensional subspace of $V$. We will be interested in determining the minimum number of queries that is needed to find $\\mathbf{v}$ provided all queries are subspaces of $V$ and the answer to a query $U$ is YES if $\\mathbf{v} \\leqslant U$ and NO if $\\mathbf{v} \\not\\leqslant U$. This number will be denoted by $A(n,q)$ in the adaptive case (when for ","authors_text":"Bal\\'azs Patk\\'os, Marcella Tak\\'ats, Tam\\'as H\\'eger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-26T06:42:13Z","title":"Search Problems in Vector Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6731","kind":"arxiv","version":2},"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:20e9eb76383855300349e68a755f104904be009e2d4d807326e0dca0d00a1bee","target":"record","created_at":"2026-05-18T02:56:43Z","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":"141cd0731d9d42d0502760840e02e206063a3637e6205e1121b7fd7e218ca580","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-26T06:42:13Z","title_canon_sha256":"1b5180ae36c6ebb38b4e84a5a46d9ae1fc3a12bb517aee74fc8ae710c6a17087"},"schema_version":"1.0","source":{"id":"1309.6731","kind":"arxiv","version":2}},"canonical_sha256":"87f5ed9fd24df06a49e36682ad9cb81c4eb761c6f38fed0fd592884ed5483625","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87f5ed9fd24df06a49e36682ad9cb81c4eb761c6f38fed0fd592884ed5483625","first_computed_at":"2026-05-18T02:56:43.947050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:43.947050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0WRnGs4Y+u62ZCJWK4+hziPA16SyBqnSd2c5n0M3AR9WtPqPrjr/ivFj1BA5oKiJEOuoJdSRIEzO2wlYCEiCCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:43.947536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6731","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20e9eb76383855300349e68a755f104904be009e2d4d807326e0dca0d00a1bee","sha256:01a5116df1d0c5ae82c5793d3eed8b5a17ab8f90d4edc276189390fd6ccda300"],"state_sha256":"b4adfc17b6681cd32216609af51346faae90357210b004c34f9ae99f5558e1d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WN2UUCdsLToWQzlf4mt7PKFVWpZESWUgl5rDtUGK3tFSWc6w3p/fwL0SfMYUepXA/awBMbZupUyx6GhbVv6XCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:52:52.889408Z","bundle_sha256":"beacb9390062d4c4c0027ed2d91ea28696bf0c7470d3c8eeb2cd951f42de9d24"}}