{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WGIA3CSQ2OYDHNTRRLHPT2JKO7","short_pith_number":"pith:WGIA3CSQ","schema_version":"1.0","canonical_sha256":"b1900d8a50d3b033b6718acef9e92a77cfb4c1c4eac4adbfb6da3e74193cc42c","source":{"kind":"arxiv","id":"1510.03370","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Logical Uncertainty and The Benford Test","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Abram Demski, Evan Lloyd, George Koleszarik, Joanna Garrabrant, Scott Garrabrant, Siddharth Bhaskar","submitted_at":"2015-10-12T17:14:44Z","abstract_excerpt":"We give an algorithm A which assigns probabilities to logical sentences. For any simple infinite sequence of sentences whose truth-values appear indistinguishable from a biased coin that outputs \"true\" with probability p, we have that the sequence of probabilities that A assigns to these sentences converges to p."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1510.03370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-12T17:14:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"399eb1cc268dedfead0458c0e6450653391f808a087e3a67d77ab1110ef1546c","abstract_canon_sha256":"556a4c8cfcd781c3d660c195b56071a42d45f951cdb6917d4bcc7a5b230313bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:26.462622Z","signature_b64":"aClOO1x0eNrgiBVGKPY5jH39Fgj5n1M9J8WQLY0GUu8w77jo/zRijd0ZPQE4DifS/bafs0R+R24l2oqy7oPYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1900d8a50d3b033b6718acef9e92a77cfb4c1c4eac4adbfb6da3e74193cc42c","last_reissued_at":"2026-05-18T01:30:26.461675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:26.461675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Logical Uncertainty and The Benford Test","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Abram Demski, Evan Lloyd, George Koleszarik, Joanna Garrabrant, Scott Garrabrant, Siddharth Bhaskar","submitted_at":"2015-10-12T17:14:44Z","abstract_excerpt":"We give an algorithm A which assigns probabilities to logical sentences. For any simple infinite sequence of sentences whose truth-values appear indistinguishable from a biased coin that outputs \"true\" with probability p, we have that the sequence of probabilities that A assigns to these sentences converges to p."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03370","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.03370","created_at":"2026-05-18T01:30:26.461806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03370v1","created_at":"2026-05-18T01:30:26.461806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03370","created_at":"2026-05-18T01:30:26.461806+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGIA3CSQ2OYD","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGIA3CSQ2OYDHNTR","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGIA3CSQ","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WGIA3CSQ2OYDHNTRRLHPT2JKO7","json":"https://pith.science/pith/WGIA3CSQ2OYDHNTRRLHPT2JKO7.json","graph_json":"https://pith.science/api/pith-number/WGIA3CSQ2OYDHNTRRLHPT2JKO7/graph.json","events_json":"https://pith.science/api/pith-number/WGIA3CSQ2OYDHNTRRLHPT2JKO7/events.json","paper":"https://pith.science/paper/WGIA3CSQ"},"agent_actions":{"view_html":"https://pith.science/pith/WGIA3CSQ2OYDHNTRRLHPT2JKO7","download_json":"https://pith.science/pith/WGIA3CSQ2OYDHNTRRLHPT2JKO7.json","view_paper":"https://pith.science/paper/WGIA3CSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03370&json=true","fetch_graph":"https://pith.science/api/pith-number/WGIA3CSQ2OYDHNTRRLHPT2JKO7/graph.json","fetch_events":"https://pith.science/api/pith-number/WGIA3CSQ2OYDHNTRRLHPT2JKO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGIA3CSQ2OYDHNTRRLHPT2JKO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGIA3CSQ2OYDHNTRRLHPT2JKO7/action/storage_attestation","attest_author":"https://pith.science/pith/WGIA3CSQ2OYDHNTRRLHPT2JKO7/action/author_attestation","sign_citation":"https://pith.science/pith/WGIA3CSQ2OYDHNTRRLHPT2JKO7/action/citation_signature","submit_replication":"https://pith.science/pith/WGIA3CSQ2OYDHNTRRLHPT2JKO7/action/replication_record"}},"created_at":"2026-05-18T01:30:26.461806+00:00","updated_at":"2026-05-18T01:30:26.461806+00:00"}