{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3M326R7UNVMFAQKYPFKFQAQZ4W","short_pith_number":"pith:3M326R7U","canonical_record":{"source":{"id":"2409.07131","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-11T09:27:50Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c50be31d83ad9e0574930e3d05e65f1b4503e0d9030231c0ced05db5d59e4ecb","abstract_canon_sha256":"c253f12ade0960cd239f9667a99ecfd8642d7e714fa83dc668951523f1954ea5"},"schema_version":"1.0"},"canonical_sha256":"db37af47f46d585041587954580219e587903266998a6ae7b4c03163b5fe872f","source":{"kind":"arxiv","id":"2409.07131","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.07131","created_at":"2026-07-05T10:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"2409.07131v2","created_at":"2026-07-05T10:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.07131","created_at":"2026-07-05T10:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"3M326R7UNVMF","created_at":"2026-07-05T10:12:19Z"},{"alias_kind":"pith_short_16","alias_value":"3M326R7UNVMFAQKY","created_at":"2026-07-05T10:12:19Z"},{"alias_kind":"pith_short_8","alias_value":"3M326R7U","created_at":"2026-07-05T10:12:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3M326R7UNVMFAQKYPFKFQAQZ4W","target":"record","payload":{"canonical_record":{"source":{"id":"2409.07131","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-11T09:27:50Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c50be31d83ad9e0574930e3d05e65f1b4503e0d9030231c0ced05db5d59e4ecb","abstract_canon_sha256":"c253f12ade0960cd239f9667a99ecfd8642d7e714fa83dc668951523f1954ea5"},"schema_version":"1.0"},"canonical_sha256":"db37af47f46d585041587954580219e587903266998a6ae7b4c03163b5fe872f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:19.726436Z","signature_b64":"j+6450uJj7XlvvUV0XL1cLDFe/74Lcaucfd7hFXMA+vn9Ws1wy74Byynjm2MoUKXNPZgp3E9QiHVDldYF6PXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db37af47f46d585041587954580219e587903266998a6ae7b4c03163b5fe872f","last_reissued_at":"2026-07-05T10:12:19.725992Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:19.725992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.07131","source_version":2,"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-05T10:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ncPgK3EVEIS+SZYX9zDxp1wj0lJm//7EURi9yni1FoML4vnbwRS8pfw+BOabVV0i6y6RQgBOgQPdKoGKEx1RBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:46:58.351341Z"},"content_sha256":"97dabb9a3918df6df2262870b88f24219ced4202bc0e8512062ef6bd3a1d24b9","schema_version":"1.0","event_id":"sha256:97dabb9a3918df6df2262870b88f24219ced4202bc0e8512062ef6bd3a1d24b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3M326R7UNVMFAQKYPFKFQAQZ4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reranking Laws for Language Generation: A Communication-Theoretic Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Andr\\'e F. T. Martins, Ant\\'onio Farinhas, Haau-sing Li","submitted_at":"2024-09-11T09:27:50Z","abstract_excerpt":"To ensure large language models (LLMs) are used safely, one must reduce their propensity to hallucinate or to generate unacceptable answers. A simple and often used strategy is to first let the LLM generate multiple hypotheses and then employ a reranker to choose the best one. In this paper, we draw a parallel between this strategy and the use of redundancy to decrease the error rate in noisy communication channels. We conceptualize the generator as a sender transmitting multiple descriptions of a message through parallel noisy channels. The receiver decodes the message by ranking the (potenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.07131","kind":"arxiv","version":2},"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/2409.07131/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-05T10:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5f0nDslsR7L4I6FCCxXleCeHqT2fzapBs8C+DbFUVUQ0vxjxVDvQsnD9RpppBHJny+0UUNuCkxbm3hLRCC97DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:46:58.351912Z"},"content_sha256":"a71206e6645f6ab73652d4a4baa6683bae4e82706bc407795acf523eb1ac9506","schema_version":"1.0","event_id":"sha256:a71206e6645f6ab73652d4a4baa6683bae4e82706bc407795acf523eb1ac9506"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3M326R7UNVMFAQKYPFKFQAQZ4W/bundle.json","state_url":"https://pith.science/pith/3M326R7UNVMFAQKYPFKFQAQZ4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3M326R7UNVMFAQKYPFKFQAQZ4W/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-12T13:46:58Z","links":{"resolver":"https://pith.science/pith/3M326R7UNVMFAQKYPFKFQAQZ4W","bundle":"https://pith.science/pith/3M326R7UNVMFAQKYPFKFQAQZ4W/bundle.json","state":"https://pith.science/pith/3M326R7UNVMFAQKYPFKFQAQZ4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3M326R7UNVMFAQKYPFKFQAQZ4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3M326R7UNVMFAQKYPFKFQAQZ4W","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":"c253f12ade0960cd239f9667a99ecfd8642d7e714fa83dc668951523f1954ea5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-11T09:27:50Z","title_canon_sha256":"c50be31d83ad9e0574930e3d05e65f1b4503e0d9030231c0ced05db5d59e4ecb"},"schema_version":"1.0","source":{"id":"2409.07131","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.07131","created_at":"2026-07-05T10:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"2409.07131v2","created_at":"2026-07-05T10:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.07131","created_at":"2026-07-05T10:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"3M326R7UNVMF","created_at":"2026-07-05T10:12:19Z"},{"alias_kind":"pith_short_16","alias_value":"3M326R7UNVMFAQKY","created_at":"2026-07-05T10:12:19Z"},{"alias_kind":"pith_short_8","alias_value":"3M326R7U","created_at":"2026-07-05T10:12:19Z"}],"graph_snapshots":[{"event_id":"sha256:a71206e6645f6ab73652d4a4baa6683bae4e82706bc407795acf523eb1ac9506","target":"graph","created_at":"2026-07-05T10:12:19Z","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/2409.07131/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To ensure large language models (LLMs) are used safely, one must reduce their propensity to hallucinate or to generate unacceptable answers. A simple and often used strategy is to first let the LLM generate multiple hypotheses and then employ a reranker to choose the best one. In this paper, we draw a parallel between this strategy and the use of redundancy to decrease the error rate in noisy communication channels. We conceptualize the generator as a sender transmitting multiple descriptions of a message through parallel noisy channels. The receiver decodes the message by ranking the (potenti","authors_text":"Andr\\'e F. T. Martins, Ant\\'onio Farinhas, Haau-sing Li","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-11T09:27:50Z","title":"Reranking Laws for Language Generation: A Communication-Theoretic Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.07131","kind":"arxiv","version":2},"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:97dabb9a3918df6df2262870b88f24219ced4202bc0e8512062ef6bd3a1d24b9","target":"record","created_at":"2026-07-05T10:12:19Z","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":"c253f12ade0960cd239f9667a99ecfd8642d7e714fa83dc668951523f1954ea5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-11T09:27:50Z","title_canon_sha256":"c50be31d83ad9e0574930e3d05e65f1b4503e0d9030231c0ced05db5d59e4ecb"},"schema_version":"1.0","source":{"id":"2409.07131","kind":"arxiv","version":2}},"canonical_sha256":"db37af47f46d585041587954580219e587903266998a6ae7b4c03163b5fe872f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db37af47f46d585041587954580219e587903266998a6ae7b4c03163b5fe872f","first_computed_at":"2026-07-05T10:12:19.725992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:12:19.725992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j+6450uJj7XlvvUV0XL1cLDFe/74Lcaucfd7hFXMA+vn9Ws1wy74Byynjm2MoUKXNPZgp3E9QiHVDldYF6PXDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:12:19.726436Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.07131","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97dabb9a3918df6df2262870b88f24219ced4202bc0e8512062ef6bd3a1d24b9","sha256:a71206e6645f6ab73652d4a4baa6683bae4e82706bc407795acf523eb1ac9506"],"state_sha256":"1822557cc26bbccc9796fd41a31e44fa6eba9c1450a157a5c182f840a3a1ea60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSUQHixyvqUYwicZKiwD7PF8Nr2Tb2eYpGPyw13R5aAjgEWFzhWqzfmrxRkPegWVxAArua3DNTx+MjTESImuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T13:46:58.356281Z","bundle_sha256":"2db62ad7aa0f4f11c3940de4e7881f29a05b057ac29069a4603c2df1b759c067"}}