{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KTPZ57SBSGNGJLLTLVDC25U6QE","short_pith_number":"pith:KTPZ57SB","schema_version":"1.0","canonical_sha256":"54df9efe41919a64ad735d462d769e81368d5c7009bb866fdd918f9d740ca7da","source":{"kind":"arxiv","id":"2607.26418","version":1},"attestation_state":"computed","paper":{"title":"DIRECTOR: Dynamic Index-based Recommendation with Transport-Optimized Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chao Feng, Chenghao Zhang, Defu Lian, Xiang Li, Yuanhao Pu","submitted_at":"2026-07-29T03:03:03Z","abstract_excerpt":"Reranking is a combinatorial decision problem that aims to select and order a high-utility slate from a request-specific candidate set. A major line of generative rerankers adopts autoregressive (AR) models, which construct the slate one position at a time to capture inter-position dependencies. However, under practical greedy or bounded-width decoding, prefix-based search may prematurely prune globally promising permutations and incurs inherently sequential latency, restricting the effective search space under a fixed serving budget. Non-autoregressive (NAR) alternatives alleviate this effici"},"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":"2607.26418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-29T03:03:03Z","cross_cats_sorted":[],"title_canon_sha256":"70e6a0452fe092a28ce2cd0fb0061f8da29e6bb3e6faa696b0c2dec75bb404c7","abstract_canon_sha256":"4143c7e9c6c0f419fa795a79704c10587a29ba5a4c3ba0d84f7f3df8276b70ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54df9efe41919a64ad735d462d769e81368d5c7009bb866fdd918f9d740ca7da","last_reissued_at":"2026-07-30T01:18:22.081787Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:18:22.081787Z"},"graph_snapshot":{"paper":{"title":"DIRECTOR: Dynamic Index-based Recommendation with Transport-Optimized Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chao Feng, Chenghao Zhang, Defu Lian, Xiang Li, Yuanhao Pu","submitted_at":"2026-07-29T03:03:03Z","abstract_excerpt":"Reranking is a combinatorial decision problem that aims to select and order a high-utility slate from a request-specific candidate set. A major line of generative rerankers adopts autoregressive (AR) models, which construct the slate one position at a time to capture inter-position dependencies. However, under practical greedy or bounded-width decoding, prefix-based search may prematurely prune globally promising permutations and incurs inherently sequential latency, restricting the effective search space under a fixed serving budget. Non-autoregressive (NAR) alternatives alleviate this effici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26418","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/2607.26418/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":"2607.26418","created_at":"2026-07-30T01:18:22.086900+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.26418v1","created_at":"2026-07-30T01:18:22.086900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26418","created_at":"2026-07-30T01:18:22.086900+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTPZ57SBSGNG","created_at":"2026-07-30T01:18:22.086900+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTPZ57SBSGNGJLLT","created_at":"2026-07-30T01:18:22.086900+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTPZ57SB","created_at":"2026-07-30T01:18:22.086900+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/KTPZ57SBSGNGJLLTLVDC25U6QE","json":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE.json","graph_json":"https://pith.science/api/pith-number/KTPZ57SBSGNGJLLTLVDC25U6QE/graph.json","events_json":"https://pith.science/api/pith-number/KTPZ57SBSGNGJLLTLVDC25U6QE/events.json","paper":"https://pith.science/paper/KTPZ57SB"},"agent_actions":{"view_html":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE","download_json":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE.json","view_paper":"https://pith.science/paper/KTPZ57SB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.26418&json=true","fetch_graph":"https://pith.science/api/pith-number/KTPZ57SBSGNGJLLTLVDC25U6QE/graph.json","fetch_events":"https://pith.science/api/pith-number/KTPZ57SBSGNGJLLTLVDC25U6QE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE/action/storage_attestation","attest_author":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE/action/author_attestation","sign_citation":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE/action/citation_signature","submit_replication":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE/action/replication_record"}},"created_at":"2026-07-30T01:18:22.086900+00:00","updated_at":"2026-07-30T01:18:22.086900+00:00"}