{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S65QM4BKX5WTDGOZ63C7HDZTOU","short_pith_number":"pith:S65QM4BK","schema_version":"1.0","canonical_sha256":"97bb06702abf6d3199d9f6c5f38f3375118739cda5d15924aba2260fc94ea40c","source":{"kind":"arxiv","id":"1807.09848","version":2},"attestation_state":"computed","paper":{"title":"Local Orthogonal-Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ahmet Iscen, Ondrej Chum","submitted_at":"2018-07-25T20:49:34Z","abstract_excerpt":"This work addresses approximate nearest neighbor search applied in the domain of large-scale image retrieval. Within the group testing framework we propose an efficient off-line construction of the search structures. The linear-time complexity orthogonal grouping increases the probability that at most one element from each group is matching to a given query. Non-maxima suppression with each group efficiently reduces the number of false positive results at no extra cost. Unlike in other well-performing approaches, all processing is local, fast, and suitable to process data in batches and in par"},"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":"1807.09848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-25T20:49:34Z","cross_cats_sorted":[],"title_canon_sha256":"fc97c3c98fd5ad3df52aebf7822f4d601e643010dd7895aed59195109051f7fa","abstract_canon_sha256":"7cc6e98319b0d473cd909aed3c9b4b184b00a1b5c981f927417f367310af6a1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:19.008730Z","signature_b64":"uextDqiQD/nlBF/jIfwZVG7iCguYXqKOqTXDhj8TdCSQu0JvVhkFrRuQ7SgLZGolNLuc79EmZjdwEiNLrVyuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97bb06702abf6d3199d9f6c5f38f3375118739cda5d15924aba2260fc94ea40c","last_reissued_at":"2026-05-18T00:05:19.008102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:19.008102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Orthogonal-Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ahmet Iscen, Ondrej Chum","submitted_at":"2018-07-25T20:49:34Z","abstract_excerpt":"This work addresses approximate nearest neighbor search applied in the domain of large-scale image retrieval. Within the group testing framework we propose an efficient off-line construction of the search structures. The linear-time complexity orthogonal grouping increases the probability that at most one element from each group is matching to a given query. Non-maxima suppression with each group efficiently reduces the number of false positive results at no extra cost. Unlike in other well-performing approaches, all processing is local, fast, and suitable to process data in batches and in par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09848","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.09848","created_at":"2026-05-18T00:05:19.008179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09848v2","created_at":"2026-05-18T00:05:19.008179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09848","created_at":"2026-05-18T00:05:19.008179+00:00"},{"alias_kind":"pith_short_12","alias_value":"S65QM4BKX5WT","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S65QM4BKX5WTDGOZ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S65QM4BK","created_at":"2026-05-18T12:32:50.500415+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/S65QM4BKX5WTDGOZ63C7HDZTOU","json":"https://pith.science/pith/S65QM4BKX5WTDGOZ63C7HDZTOU.json","graph_json":"https://pith.science/api/pith-number/S65QM4BKX5WTDGOZ63C7HDZTOU/graph.json","events_json":"https://pith.science/api/pith-number/S65QM4BKX5WTDGOZ63C7HDZTOU/events.json","paper":"https://pith.science/paper/S65QM4BK"},"agent_actions":{"view_html":"https://pith.science/pith/S65QM4BKX5WTDGOZ63C7HDZTOU","download_json":"https://pith.science/pith/S65QM4BKX5WTDGOZ63C7HDZTOU.json","view_paper":"https://pith.science/paper/S65QM4BK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09848&json=true","fetch_graph":"https://pith.science/api/pith-number/S65QM4BKX5WTDGOZ63C7HDZTOU/graph.json","fetch_events":"https://pith.science/api/pith-number/S65QM4BKX5WTDGOZ63C7HDZTOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S65QM4BKX5WTDGOZ63C7HDZTOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S65QM4BKX5WTDGOZ63C7HDZTOU/action/storage_attestation","attest_author":"https://pith.science/pith/S65QM4BKX5WTDGOZ63C7HDZTOU/action/author_attestation","sign_citation":"https://pith.science/pith/S65QM4BKX5WTDGOZ63C7HDZTOU/action/citation_signature","submit_replication":"https://pith.science/pith/S65QM4BKX5WTDGOZ63C7HDZTOU/action/replication_record"}},"created_at":"2026-05-18T00:05:19.008179+00:00","updated_at":"2026-05-18T00:05:19.008179+00:00"}