{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KTPZ57SBSGNGJLLTLVDC25U6QE","short_pith_number":"pith:KTPZ57SB","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"},"canonical_sha256":"54df9efe41919a64ad735d462d769e81368d5c7009bb866fdd918f9d740ca7da","source":{"kind":"arxiv","id":"2607.26418","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26418","created_at":"2026-07-30T01:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26418v1","created_at":"2026-07-30T01:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26418","created_at":"2026-07-30T01:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"KTPZ57SBSGNG","created_at":"2026-07-30T01:18:22Z"},{"alias_kind":"pith_short_16","alias_value":"KTPZ57SBSGNGJLLT","created_at":"2026-07-30T01:18:22Z"},{"alias_kind":"pith_short_8","alias_value":"KTPZ57SB","created_at":"2026-07-30T01:18:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KTPZ57SBSGNGJLLTLVDC25U6QE","target":"record","payload":{"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"},"canonical_sha256":"54df9efe41919a64ad735d462d769e81368d5c7009bb866fdd918f9d740ca7da","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"},"source_kind":"arxiv","source_id":"2607.26418","source_version":1,"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-07-30T01:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFtiuVoH/90QL1EVnRSZr/pWVpuXuYgkkKeif19ZYihjug5MoV+BjZjYhaaQM9PQfnU97Jjspt9JJ8BSx6/gBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:58:02.909422Z"},"content_sha256":"a8d578ff23ef43670bc96c55efebf6bfef35aafa74d1cd91896c11ef69976d7f","schema_version":"1.0","event_id":"sha256:a8d578ff23ef43670bc96c55efebf6bfef35aafa74d1cd91896c11ef69976d7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KTPZ57SBSGNGJLLTLVDC25U6QE","target":"graph","payload":{"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"},"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-07-30T01:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCx9tQgn1qEkI00BRbim4C+11oZafNChhqeLzgAZeZCJ6+ZEPWusW+RdV9+ajYXKOro1QI0+x20/DIj8cQSiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:58:02.909927Z"},"content_sha256":"f2432fa7fe4959a7a3174426323a7b500a843625656e1ebde1b0761fbba4203b","schema_version":"1.0","event_id":"sha256:f2432fa7fe4959a7a3174426323a7b500a843625656e1ebde1b0761fbba4203b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE/bundle.json","state_url":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTPZ57SBSGNGJLLTLVDC25U6QE/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-08-05T23:58:02Z","links":{"resolver":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE","bundle":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE/bundle.json","state":"https://pith.science/pith/KTPZ57SBSGNGJLLTLVDC25U6QE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTPZ57SBSGNGJLLTLVDC25U6QE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KTPZ57SBSGNGJLLTLVDC25U6QE","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":"4143c7e9c6c0f419fa795a79704c10587a29ba5a4c3ba0d84f7f3df8276b70ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-29T03:03:03Z","title_canon_sha256":"70e6a0452fe092a28ce2cd0fb0061f8da29e6bb3e6faa696b0c2dec75bb404c7"},"schema_version":"1.0","source":{"id":"2607.26418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26418","created_at":"2026-07-30T01:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26418v1","created_at":"2026-07-30T01:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26418","created_at":"2026-07-30T01:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"KTPZ57SBSGNG","created_at":"2026-07-30T01:18:22Z"},{"alias_kind":"pith_short_16","alias_value":"KTPZ57SBSGNGJLLT","created_at":"2026-07-30T01:18:22Z"},{"alias_kind":"pith_short_8","alias_value":"KTPZ57SB","created_at":"2026-07-30T01:18:22Z"}],"graph_snapshots":[{"event_id":"sha256:f2432fa7fe4959a7a3174426323a7b500a843625656e1ebde1b0761fbba4203b","target":"graph","created_at":"2026-07-30T01:18:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.26418/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chao Feng, Chenghao Zhang, Defu Lian, Xiang Li, Yuanhao Pu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-29T03:03:03Z","title":"DIRECTOR: Dynamic Index-based Recommendation with Transport-Optimized Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26418","kind":"arxiv","version":1},"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:a8d578ff23ef43670bc96c55efebf6bfef35aafa74d1cd91896c11ef69976d7f","target":"record","created_at":"2026-07-30T01:18:22Z","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":"4143c7e9c6c0f419fa795a79704c10587a29ba5a4c3ba0d84f7f3df8276b70ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-29T03:03:03Z","title_canon_sha256":"70e6a0452fe092a28ce2cd0fb0061f8da29e6bb3e6faa696b0c2dec75bb404c7"},"schema_version":"1.0","source":{"id":"2607.26418","kind":"arxiv","version":1}},"canonical_sha256":"54df9efe41919a64ad735d462d769e81368d5c7009bb866fdd918f9d740ca7da","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54df9efe41919a64ad735d462d769e81368d5c7009bb866fdd918f9d740ca7da","first_computed_at":"2026-07-30T01:18:22.081787Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:18:22.081787Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.26418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8d578ff23ef43670bc96c55efebf6bfef35aafa74d1cd91896c11ef69976d7f","sha256:f2432fa7fe4959a7a3174426323a7b500a843625656e1ebde1b0761fbba4203b"],"state_sha256":"1f42bd03ee3706d52b1318bb4aa6c5e35c782c3c386bf1799f209157ae084121"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDBXq3llkZD+YsIOYx4rN2DvF25VSxfVawQKondyUBTyh60fMKyPNRz/yvTrUOirXibqpMaFGBzS78rGVmwOCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T23:58:02.913278Z","bundle_sha256":"5787efd2b46f4c01cd4c978dd02b0972b247f6637d76cc1aecddf497e5cabb3b"}}