{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CJRUMFIZTVKFU2M63WWGSADL5A","short_pith_number":"pith:CJRUMFIZ","canonical_record":{"source":{"id":"2607.25068","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-27T20:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"be8e68972ed08d31874bd7bb2e84e0b7a6f4322fb021ba7fe9a34d49e41f1dff","abstract_canon_sha256":"a2bf7d73d93097ca3eca19e90ed08fed84c7775c2d304f07207e0f6bf5e99824"},"schema_version":"1.0"},"canonical_sha256":"12634615199d545a699eddac69006be82def707f9dbc9656228e4cc5432bdf7c","source":{"kind":"arxiv","id":"2607.25068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.25068","created_at":"2026-07-29T00:25:00Z"},{"alias_kind":"arxiv_version","alias_value":"2607.25068v1","created_at":"2026-07-29T00:25:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25068","created_at":"2026-07-29T00:25:00Z"},{"alias_kind":"pith_short_12","alias_value":"CJRUMFIZTVKF","created_at":"2026-07-29T00:25:00Z"},{"alias_kind":"pith_short_16","alias_value":"CJRUMFIZTVKFU2M6","created_at":"2026-07-29T00:25:00Z"},{"alias_kind":"pith_short_8","alias_value":"CJRUMFIZ","created_at":"2026-07-29T00:25:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CJRUMFIZTVKFU2M63WWGSADL5A","target":"record","payload":{"canonical_record":{"source":{"id":"2607.25068","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-27T20:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"be8e68972ed08d31874bd7bb2e84e0b7a6f4322fb021ba7fe9a34d49e41f1dff","abstract_canon_sha256":"a2bf7d73d93097ca3eca19e90ed08fed84c7775c2d304f07207e0f6bf5e99824"},"schema_version":"1.0"},"canonical_sha256":"12634615199d545a699eddac69006be82def707f9dbc9656228e4cc5432bdf7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T00:25:00.952328Z","signature_b64":"Yl925pPtXHi80CBSANNLydcemN5EJOHQK6q9T6aPUYPgFEaHI8XUPTyiMsSmnOmlOJjjVF8YUru6cSd6QOd4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12634615199d545a699eddac69006be82def707f9dbc9656228e4cc5432bdf7c","last_reissued_at":"2026-07-29T00:25:00.951506Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T00:25:00.951506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.25068","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-29T00:25:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5EaOZbVS0Tfc1vJ15QBf0qI9oL9KZ/f2O5OaXmZYKoI/R7MnlcEkCu5ZTl0FlqI9d75xJO3c2iS2i/uXf4J1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:31:01.999715Z"},"content_sha256":"b496ac0f5e11573d0c2cea5925d086b10c4a4670288af7f141996146b382648c","schema_version":"1.0","event_id":"sha256:b496ac0f5e11573d0c2cea5925d086b10c4a4670288af7f141996146b382648c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CJRUMFIZTVKFU2M63WWGSADL5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Often Should a Recommender Call an LLM? Value-Weighted Routing, Monitoring, and Seasonal Robustness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bhavtosh Rath","submitted_at":"2026-07-27T20:52:15Z","abstract_excerpt":"Routing decisions between a cheap heuristic and an expensive large language model (LLM) are typically framed as a difficulty problem: send the hard cases to the expensive path. We argue this framing is incomplete because difficulty and business value are distinct axes - a difficult cheap item and a difficult costly item do not have the same cost of error. We present Value Router, a fully synthetic simulation of a retail merchandising pipeline that routes items using only estimated difficulty and estimated value, never ground truth. The study has three stages. First, a value-weighted threshold "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25068","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.25068/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-29T00:25:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMzuO7Z9L2g1NrBK/MgHq/b/LIxA6qx1iLIx22cXG6e/jl3TB8xLfGSTrgWctbbW8x8eNUxshdNlUKdovSk6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:31:02.000318Z"},"content_sha256":"0b845f00b213a35402edd1f6755994d236741bae2fb327aee38ca4271a210975","schema_version":"1.0","event_id":"sha256:0b845f00b213a35402edd1f6755994d236741bae2fb327aee38ca4271a210975"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJRUMFIZTVKFU2M63WWGSADL5A/bundle.json","state_url":"https://pith.science/pith/CJRUMFIZTVKFU2M63WWGSADL5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJRUMFIZTVKFU2M63WWGSADL5A/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-04T06:31:02Z","links":{"resolver":"https://pith.science/pith/CJRUMFIZTVKFU2M63WWGSADL5A","bundle":"https://pith.science/pith/CJRUMFIZTVKFU2M63WWGSADL5A/bundle.json","state":"https://pith.science/pith/CJRUMFIZTVKFU2M63WWGSADL5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJRUMFIZTVKFU2M63WWGSADL5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CJRUMFIZTVKFU2M63WWGSADL5A","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":"a2bf7d73d93097ca3eca19e90ed08fed84c7775c2d304f07207e0f6bf5e99824","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-27T20:52:15Z","title_canon_sha256":"be8e68972ed08d31874bd7bb2e84e0b7a6f4322fb021ba7fe9a34d49e41f1dff"},"schema_version":"1.0","source":{"id":"2607.25068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.25068","created_at":"2026-07-29T00:25:00Z"},{"alias_kind":"arxiv_version","alias_value":"2607.25068v1","created_at":"2026-07-29T00:25:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25068","created_at":"2026-07-29T00:25:00Z"},{"alias_kind":"pith_short_12","alias_value":"CJRUMFIZTVKF","created_at":"2026-07-29T00:25:00Z"},{"alias_kind":"pith_short_16","alias_value":"CJRUMFIZTVKFU2M6","created_at":"2026-07-29T00:25:00Z"},{"alias_kind":"pith_short_8","alias_value":"CJRUMFIZ","created_at":"2026-07-29T00:25:00Z"}],"graph_snapshots":[{"event_id":"sha256:0b845f00b213a35402edd1f6755994d236741bae2fb327aee38ca4271a210975","target":"graph","created_at":"2026-07-29T00:25:00Z","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.25068/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Routing decisions between a cheap heuristic and an expensive large language model (LLM) are typically framed as a difficulty problem: send the hard cases to the expensive path. We argue this framing is incomplete because difficulty and business value are distinct axes - a difficult cheap item and a difficult costly item do not have the same cost of error. We present Value Router, a fully synthetic simulation of a retail merchandising pipeline that routes items using only estimated difficulty and estimated value, never ground truth. The study has three stages. First, a value-weighted threshold ","authors_text":"Bhavtosh Rath","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-27T20:52:15Z","title":"How Often Should a Recommender Call an LLM? Value-Weighted Routing, Monitoring, and Seasonal Robustness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25068","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:b496ac0f5e11573d0c2cea5925d086b10c4a4670288af7f141996146b382648c","target":"record","created_at":"2026-07-29T00:25:00Z","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":"a2bf7d73d93097ca3eca19e90ed08fed84c7775c2d304f07207e0f6bf5e99824","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-27T20:52:15Z","title_canon_sha256":"be8e68972ed08d31874bd7bb2e84e0b7a6f4322fb021ba7fe9a34d49e41f1dff"},"schema_version":"1.0","source":{"id":"2607.25068","kind":"arxiv","version":1}},"canonical_sha256":"12634615199d545a699eddac69006be82def707f9dbc9656228e4cc5432bdf7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12634615199d545a699eddac69006be82def707f9dbc9656228e4cc5432bdf7c","first_computed_at":"2026-07-29T00:25:00.951506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-29T00:25:00.951506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yl925pPtXHi80CBSANNLydcemN5EJOHQK6q9T6aPUYPgFEaHI8XUPTyiMsSmnOmlOJjjVF8YUru6cSd6QOd4Cg==","signature_status":"signed_v1","signed_at":"2026-07-29T00:25:00.952328Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.25068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b496ac0f5e11573d0c2cea5925d086b10c4a4670288af7f141996146b382648c","sha256:0b845f00b213a35402edd1f6755994d236741bae2fb327aee38ca4271a210975"],"state_sha256":"2fb1ee185faab33b0fd8a2cd479a36e07bd794c20c9d1a37830bb05d1fa087c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPjlh954k9NwdNqo4SM2TnnTTNPKcRDbo5MGDgIC/9W8+NcSsElp6tVKc3dfyJt7WXjVVDleuMj7ucacurJPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T06:31:02.007777Z","bundle_sha256":"69358b2f83dbb9f3c675492361a9e0e19d1107936269a865309bef75985c4234"}}