{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IXFHFENH2RAX67SSONUAVZPQ7Y","short_pith_number":"pith:IXFHFENH","schema_version":"1.0","canonical_sha256":"45ca7291a7d4417f7e5273680ae5f0fe35fc87cd53773de739b4bec97b9db659","source":{"kind":"arxiv","id":"2606.01097","version":1},"attestation_state":"computed","paper":{"title":"Dual-Route Top-K Retrieval with 1v1 VLM Reranking for the CoVR-R","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jay Wu, Shuo Wang, Wenbo Zhu, Xingyu Zhu, Xu Yang, Yangguang Ji, Yanxi Shi, Yongliang Wu, Yuxia Chen, Yuyang Sun, Zhenxiang Jiang","submitted_at":"2026-05-31T08:38:57Z","abstract_excerpt":"We describe \\emph{Dual-Route Top-K Retrieval with 1v1 VLM Reranking} for the CoVR-R challenge. The method treats composed video retrieval as two coupled problems: finding a sufficiently complete top-k candidate set, and then safely deciding whether any candidate should replace a strong current top-1. We first improve the reasoning/text seed with a VLM slot selector over existing candidates, without introducing DFN visual retrieval. We then add a visual route from contact-sheet embeddings using DFN-H/DFN-L. The routes are merged into a top-10 candidate set, after which a VLM final reranker perf"},"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.01097","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-31T08:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"e2c40f32de3971e568a6d5749dcfce9b79409a08f59283a5dba66b474fa7c939","abstract_canon_sha256":"8302a81f606df5993d88ad2c65e6a465a3e57a6d5922c625057535f6ce1b4eba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:23.366155Z","signature_b64":"WmtT0fFCyvc7+ZwXCl+1rnu9EMAIpfhiw3AB2j1y6NOAM7u0Nwaxg8HAcgU44RM1PMURVjWs+3+6T3+miiMACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45ca7291a7d4417f7e5273680ae5f0fe35fc87cd53773de739b4bec97b9db659","last_reissued_at":"2026-06-02T02:04:23.365646Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:23.365646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual-Route Top-K Retrieval with 1v1 VLM Reranking for the CoVR-R","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jay Wu, Shuo Wang, Wenbo Zhu, Xingyu Zhu, Xu Yang, Yangguang Ji, Yanxi Shi, Yongliang Wu, Yuxia Chen, Yuyang Sun, Zhenxiang Jiang","submitted_at":"2026-05-31T08:38:57Z","abstract_excerpt":"We describe \\emph{Dual-Route Top-K Retrieval with 1v1 VLM Reranking} for the CoVR-R challenge. The method treats composed video retrieval as two coupled problems: finding a sufficiently complete top-k candidate set, and then safely deciding whether any candidate should replace a strong current top-1. We first improve the reasoning/text seed with a VLM slot selector over existing candidates, without introducing DFN visual retrieval. We then add a visual route from contact-sheet embeddings using DFN-H/DFN-L. The routes are merged into a top-10 candidate set, after which a VLM final reranker perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01097","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.01097/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.01097","created_at":"2026-06-02T02:04:23.365715+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01097v1","created_at":"2026-06-02T02:04:23.365715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01097","created_at":"2026-06-02T02:04:23.365715+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXFHFENH2RAX","created_at":"2026-06-02T02:04:23.365715+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXFHFENH2RAX67SS","created_at":"2026-06-02T02:04:23.365715+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXFHFENH","created_at":"2026-06-02T02:04:23.365715+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/IXFHFENH2RAX67SSONUAVZPQ7Y","json":"https://pith.science/pith/IXFHFENH2RAX67SSONUAVZPQ7Y.json","graph_json":"https://pith.science/api/pith-number/IXFHFENH2RAX67SSONUAVZPQ7Y/graph.json","events_json":"https://pith.science/api/pith-number/IXFHFENH2RAX67SSONUAVZPQ7Y/events.json","paper":"https://pith.science/paper/IXFHFENH"},"agent_actions":{"view_html":"https://pith.science/pith/IXFHFENH2RAX67SSONUAVZPQ7Y","download_json":"https://pith.science/pith/IXFHFENH2RAX67SSONUAVZPQ7Y.json","view_paper":"https://pith.science/paper/IXFHFENH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01097&json=true","fetch_graph":"https://pith.science/api/pith-number/IXFHFENH2RAX67SSONUAVZPQ7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/IXFHFENH2RAX67SSONUAVZPQ7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXFHFENH2RAX67SSONUAVZPQ7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXFHFENH2RAX67SSONUAVZPQ7Y/action/storage_attestation","attest_author":"https://pith.science/pith/IXFHFENH2RAX67SSONUAVZPQ7Y/action/author_attestation","sign_citation":"https://pith.science/pith/IXFHFENH2RAX67SSONUAVZPQ7Y/action/citation_signature","submit_replication":"https://pith.science/pith/IXFHFENH2RAX67SSONUAVZPQ7Y/action/replication_record"}},"created_at":"2026-06-02T02:04:23.365715+00:00","updated_at":"2026-06-02T02:04:23.365715+00:00"}