{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WWHWBXDL4QMBFAXNWISKS4HVKG","short_pith_number":"pith:WWHWBXDL","canonical_record":{"source":{"id":"2506.16655","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-06-19T23:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"ef210e8599af7d08601f0e187519e7f1ce5e2dbd0492b231c73f4943c38c86dc","abstract_canon_sha256":"3062d132ee6a1a5655d90c94351eeecd0943d2b66062c5da973e8281daea134b"},"schema_version":"1.0"},"canonical_sha256":"b58f60dc6be4181282edb224a970f551880ee380d6e79dc42cd2b9620d8debcd","source":{"kind":"arxiv","id":"2506.16655","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.16655","created_at":"2026-07-05T11:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"2506.16655v1","created_at":"2026-07-05T11:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16655","created_at":"2026-07-05T11:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"WWHWBXDL4QMB","created_at":"2026-07-05T11:24:40Z"},{"alias_kind":"pith_short_16","alias_value":"WWHWBXDL4QMBFAXN","created_at":"2026-07-05T11:24:40Z"},{"alias_kind":"pith_short_8","alias_value":"WWHWBXDL","created_at":"2026-07-05T11:24:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WWHWBXDL4QMBFAXNWISKS4HVKG","target":"record","payload":{"canonical_record":{"source":{"id":"2506.16655","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-06-19T23:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"ef210e8599af7d08601f0e187519e7f1ce5e2dbd0492b231c73f4943c38c86dc","abstract_canon_sha256":"3062d132ee6a1a5655d90c94351eeecd0943d2b66062c5da973e8281daea134b"},"schema_version":"1.0"},"canonical_sha256":"b58f60dc6be4181282edb224a970f551880ee380d6e79dc42cd2b9620d8debcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:40.279458Z","signature_b64":"zHx4c3+RxV1Xxvs59zyxiitlnlcCo7S9WdermDwEvIKJ41nwB6X0fVDTsrVPkonCnjiC8V37B1Vz69QWWYNCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b58f60dc6be4181282edb224a970f551880ee380d6e79dc42cd2b9620d8debcd","last_reissued_at":"2026-07-05T11:24:40.278952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:40.278952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.16655","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-05T11:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ntwzlRWnfJYfcaeQIAYg/9VwYIvLZtYUZ8J0vDug1m7zwNhw3bvguqhe7evpzrEeuzMknCkozF1gwXDhAXGSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:33:17.568533Z"},"content_sha256":"d05068063bd01dfaa5b88734451c875388d0737a9cb67d7eeca0b57153fdba8e","schema_version":"1.0","event_id":"sha256:d05068063bd01dfaa5b88734451c875388d0737a9cb67d7eeca0b57153fdba8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WWHWBXDL4QMBFAXNWISKS4HVKG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Arch-Router: Aligning LLM Routing with Human Preferences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Adil Hafeez, Co Tran, Salman Paracha, Shuguang Chen","submitted_at":"2025-06-19T23:57:41Z","abstract_excerpt":"With the rapid proliferation of large language models (LLMs) -- each optimized for different strengths, style, or latency/cost profile -- routing has become an essential technique to operationalize the use of different models. However, existing LLM routing approaches are limited in two key ways: they evaluate performance using benchmarks that often fail to capture human preferences driven by subjective evaluation criteria, and they typically select from a limited pool of models. In this work, we propose a preference-aligned routing framework that guides model selection by matching queries to u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16655","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/2506.16655/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-05T11:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Rf7LNB40gT8SNTNW6HruAKR6KQDAGaCvevyclPXFP1qMdq2hcr+TeNru/0u/x2cfQfCbwtU4mPrlCMJ9Hj1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:33:17.568943Z"},"content_sha256":"fb79c5cd9d357bb75b51f020aabfa92ffe6f5b836a43459de544438223e7f45c","schema_version":"1.0","event_id":"sha256:fb79c5cd9d357bb75b51f020aabfa92ffe6f5b836a43459de544438223e7f45c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG/bundle.json","state_url":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWHWBXDL4QMBFAXNWISKS4HVKG/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-05T18:33:17Z","links":{"resolver":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG","bundle":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG/bundle.json","state":"https://pith.science/pith/WWHWBXDL4QMBFAXNWISKS4HVKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWHWBXDL4QMBFAXNWISKS4HVKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WWHWBXDL4QMBFAXNWISKS4HVKG","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":"3062d132ee6a1a5655d90c94351eeecd0943d2b66062c5da973e8281daea134b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-06-19T23:57:41Z","title_canon_sha256":"ef210e8599af7d08601f0e187519e7f1ce5e2dbd0492b231c73f4943c38c86dc"},"schema_version":"1.0","source":{"id":"2506.16655","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.16655","created_at":"2026-07-05T11:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"2506.16655v1","created_at":"2026-07-05T11:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16655","created_at":"2026-07-05T11:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"WWHWBXDL4QMB","created_at":"2026-07-05T11:24:40Z"},{"alias_kind":"pith_short_16","alias_value":"WWHWBXDL4QMBFAXN","created_at":"2026-07-05T11:24:40Z"},{"alias_kind":"pith_short_8","alias_value":"WWHWBXDL","created_at":"2026-07-05T11:24:40Z"}],"graph_snapshots":[{"event_id":"sha256:fb79c5cd9d357bb75b51f020aabfa92ffe6f5b836a43459de544438223e7f45c","target":"graph","created_at":"2026-07-05T11:24:40Z","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/2506.16655/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"With the rapid proliferation of large language models (LLMs) -- each optimized for different strengths, style, or latency/cost profile -- routing has become an essential technique to operationalize the use of different models. However, existing LLM routing approaches are limited in two key ways: they evaluate performance using benchmarks that often fail to capture human preferences driven by subjective evaluation criteria, and they typically select from a limited pool of models. In this work, we propose a preference-aligned routing framework that guides model selection by matching queries to u","authors_text":"Adil Hafeez, Co Tran, Salman Paracha, Shuguang Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-06-19T23:57:41Z","title":"Arch-Router: Aligning LLM Routing with Human Preferences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16655","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:d05068063bd01dfaa5b88734451c875388d0737a9cb67d7eeca0b57153fdba8e","target":"record","created_at":"2026-07-05T11:24:40Z","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":"3062d132ee6a1a5655d90c94351eeecd0943d2b66062c5da973e8281daea134b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-06-19T23:57:41Z","title_canon_sha256":"ef210e8599af7d08601f0e187519e7f1ce5e2dbd0492b231c73f4943c38c86dc"},"schema_version":"1.0","source":{"id":"2506.16655","kind":"arxiv","version":1}},"canonical_sha256":"b58f60dc6be4181282edb224a970f551880ee380d6e79dc42cd2b9620d8debcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b58f60dc6be4181282edb224a970f551880ee380d6e79dc42cd2b9620d8debcd","first_computed_at":"2026-07-05T11:24:40.278952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:24:40.278952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zHx4c3+RxV1Xxvs59zyxiitlnlcCo7S9WdermDwEvIKJ41nwB6X0fVDTsrVPkonCnjiC8V37B1Vz69QWWYNCDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:24:40.279458Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.16655","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d05068063bd01dfaa5b88734451c875388d0737a9cb67d7eeca0b57153fdba8e","sha256:fb79c5cd9d357bb75b51f020aabfa92ffe6f5b836a43459de544438223e7f45c"],"state_sha256":"5e03604db4a23a16e332773f1781b1f3137146ac06ed8544ed890a9a3f5a1990"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BuSlp5H6x5MhfKs0rN4Qa95rklOmqb+1gHgKSrxghL5wU/jP5Z9DVWfDp7z6HPtfXjg/As/dOzkdURxr1HAjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T18:33:17.572630Z","bundle_sha256":"2bde2b99d5929c54e56f18726c9bc73bd61af8b9cfe0ac4b9c1a86aa95f2eb0b"}}