{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:PMTRRNNA5VO5QX3BSI7TN7COYN","short_pith_number":"pith:PMTRRNNA","canonical_record":{"source":{"id":"2410.04707","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T02:52:30Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"54235b4effcb53545fa0611ee0075595b665daeaba35b2cc48a66b42151f7a5d","abstract_canon_sha256":"a687f34c391e17808394baec5a04370523245a2380f4fb72e77df0e289f2460f"},"schema_version":"1.0"},"canonical_sha256":"7b2718b5a0ed5dd85f61923f36fc4ec340a742c55955b68440b2f5c5423b4773","source":{"kind":"arxiv","id":"2410.04707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.04707","created_at":"2026-07-05T09:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"2410.04707v1","created_at":"2026-07-05T09:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04707","created_at":"2026-07-05T09:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"PMTRRNNA5VO5","created_at":"2026-07-05T09:16:54Z"},{"alias_kind":"pith_short_16","alias_value":"PMTRRNNA5VO5QX3B","created_at":"2026-07-05T09:16:54Z"},{"alias_kind":"pith_short_8","alias_value":"PMTRRNNA","created_at":"2026-07-05T09:16:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:PMTRRNNA5VO5QX3BSI7TN7COYN","target":"record","payload":{"canonical_record":{"source":{"id":"2410.04707","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T02:52:30Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"54235b4effcb53545fa0611ee0075595b665daeaba35b2cc48a66b42151f7a5d","abstract_canon_sha256":"a687f34c391e17808394baec5a04370523245a2380f4fb72e77df0e289f2460f"},"schema_version":"1.0"},"canonical_sha256":"7b2718b5a0ed5dd85f61923f36fc4ec340a742c55955b68440b2f5c5423b4773","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:16:54.953558Z","signature_b64":"VIMKtVrIUqGEQ5kVNTTgPIU93OSpBDWJEeVf7ACZ4zSO/bVya4WsavXmhWH0AAGMA8cZ7tY/3qzH4jnZvdxjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b2718b5a0ed5dd85f61923f36fc4ec340a742c55955b68440b2f5c5423b4773","last_reissued_at":"2026-07-05T09:16:54.953070Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:16:54.953070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.04707","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-05T09:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyWT8xA1VXySLX8D/ronaryK6ke4L4qB6Fk83yEV/2Dg1gXVR3dTutEF5pkp9dCkwfyc4e4kXv2uNT+IEDSrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:37:08.508056Z"},"content_sha256":"d3841446d3230c0a78cd584ec36c838a7adc375acb0ce9b3223b9cbcb3f19f6e","schema_version":"1.0","event_id":"sha256:d3841446d3230c0a78cd584ec36c838a7adc375acb0ce9b3223b9cbcb3f19f6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:PMTRRNNA5VO5QX3BSI7TN7COYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning How Hard to Think: Input-Adaptive Allocation of LM Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Andi Peng, Andreea Bobu, Idan Shenfeld, Jacob Andreas, Mehul Damani","submitted_at":"2024-10-07T02:52:30Z","abstract_excerpt":"Computationally intensive decoding procedures--including search, reranking, and self-critique--can improve the quality of language model (LM) outputs in problems spanning code generation, numerical reasoning, and dialog. Existing work typically applies the same decoding procedure for every input to an LM. But not all inputs require the same amount of computation to process. Can we allocate decoding computation adaptively, using more resources to answer questions whose answers will be harder to compute? We present an approach that predicts the distribution of rewards given an input and computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.04707","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/2410.04707/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-05T09:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bBofyQnODD9r/dDl0nOFvLLNdQwz+UEbaxc2681a+10rDPUwmBOfgpsa/Wzu4FhOYQ4mXWg/2tO+5pAxEsllBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:37:08.508583Z"},"content_sha256":"d34e8dff223173d15b5eecea55df37c833f03693eb0db0caf908e7e7dcba6548","schema_version":"1.0","event_id":"sha256:d34e8dff223173d15b5eecea55df37c833f03693eb0db0caf908e7e7dcba6548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PMTRRNNA5VO5QX3BSI7TN7COYN/bundle.json","state_url":"https://pith.science/pith/PMTRRNNA5VO5QX3BSI7TN7COYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PMTRRNNA5VO5QX3BSI7TN7COYN/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-05T12:37:08Z","links":{"resolver":"https://pith.science/pith/PMTRRNNA5VO5QX3BSI7TN7COYN","bundle":"https://pith.science/pith/PMTRRNNA5VO5QX3BSI7TN7COYN/bundle.json","state":"https://pith.science/pith/PMTRRNNA5VO5QX3BSI7TN7COYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PMTRRNNA5VO5QX3BSI7TN7COYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:PMTRRNNA5VO5QX3BSI7TN7COYN","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":"a687f34c391e17808394baec5a04370523245a2380f4fb72e77df0e289f2460f","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T02:52:30Z","title_canon_sha256":"54235b4effcb53545fa0611ee0075595b665daeaba35b2cc48a66b42151f7a5d"},"schema_version":"1.0","source":{"id":"2410.04707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.04707","created_at":"2026-07-05T09:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"2410.04707v1","created_at":"2026-07-05T09:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04707","created_at":"2026-07-05T09:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"PMTRRNNA5VO5","created_at":"2026-07-05T09:16:54Z"},{"alias_kind":"pith_short_16","alias_value":"PMTRRNNA5VO5QX3B","created_at":"2026-07-05T09:16:54Z"},{"alias_kind":"pith_short_8","alias_value":"PMTRRNNA","created_at":"2026-07-05T09:16:54Z"}],"graph_snapshots":[{"event_id":"sha256:d34e8dff223173d15b5eecea55df37c833f03693eb0db0caf908e7e7dcba6548","target":"graph","created_at":"2026-07-05T09:16:54Z","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/2410.04707/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Computationally intensive decoding procedures--including search, reranking, and self-critique--can improve the quality of language model (LM) outputs in problems spanning code generation, numerical reasoning, and dialog. Existing work typically applies the same decoding procedure for every input to an LM. But not all inputs require the same amount of computation to process. Can we allocate decoding computation adaptively, using more resources to answer questions whose answers will be harder to compute? We present an approach that predicts the distribution of rewards given an input and computat","authors_text":"Andi Peng, Andreea Bobu, Idan Shenfeld, Jacob Andreas, Mehul Damani","cross_cats":["cs.AI","cs.CL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T02:52:30Z","title":"Learning How Hard to Think: Input-Adaptive Allocation of LM Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.04707","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:d3841446d3230c0a78cd584ec36c838a7adc375acb0ce9b3223b9cbcb3f19f6e","target":"record","created_at":"2026-07-05T09:16:54Z","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":"a687f34c391e17808394baec5a04370523245a2380f4fb72e77df0e289f2460f","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T02:52:30Z","title_canon_sha256":"54235b4effcb53545fa0611ee0075595b665daeaba35b2cc48a66b42151f7a5d"},"schema_version":"1.0","source":{"id":"2410.04707","kind":"arxiv","version":1}},"canonical_sha256":"7b2718b5a0ed5dd85f61923f36fc4ec340a742c55955b68440b2f5c5423b4773","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b2718b5a0ed5dd85f61923f36fc4ec340a742c55955b68440b2f5c5423b4773","first_computed_at":"2026-07-05T09:16:54.953070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:16:54.953070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VIMKtVrIUqGEQ5kVNTTgPIU93OSpBDWJEeVf7ACZ4zSO/bVya4WsavXmhWH0AAGMA8cZ7tY/3qzH4jnZvdxjBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:16:54.953558Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.04707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3841446d3230c0a78cd584ec36c838a7adc375acb0ce9b3223b9cbcb3f19f6e","sha256:d34e8dff223173d15b5eecea55df37c833f03693eb0db0caf908e7e7dcba6548"],"state_sha256":"e55d84603e4a65968d516af0b57974edb822f2b37faa61930b8c19da56374c47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2xsE2Pce5mu7DnWxCizTBdfdCH3WVQLa8a449vn1DgLYWFyQ/MT6duMG6Uwtnh7RmGvn4JaaPWe7+5slHbo0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T12:37:08.512285Z","bundle_sha256":"850fa5e4109c18ec482b364f6663517c23fef916ffbd6f39b9688d9c49a21320"}}