{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N6UKRFMHDQ5J45ADR3ZLJEYRNA","short_pith_number":"pith:N6UKRFMH","schema_version":"1.0","canonical_sha256":"6fa8a895871c3a9e74038ef2b4931168059669bc08b0af71f718aa9785281676","source":{"kind":"arxiv","id":"1701.02547","version":4},"attestation_state":"computed","paper":{"title":"A Convenient Category for Higher-Order Probability Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO","math.CT","math.PR"],"primary_cat":"cs.PL","authors_text":"Chris Heunen, Hongseok Yang, Ohad Kammar, Sam Staton","submitted_at":"2017-01-10T12:19:05Z","abstract_excerpt":"Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of probability theory. Programs may use both higher-order functions and continuous distributions, or even define a probability distribution on functions. But standard probability theory does not handle higher-order functions well: the category of measurable spaces is not cartesian closed.\n  Here we introduce quasi-Borel spaces. We show that these spaces: form a new form"},"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":"1701.02547","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-10T12:19:05Z","cross_cats_sorted":["cs.AI","cs.LO","math.CT","math.PR"],"title_canon_sha256":"c888179b6c46003e92589bf29ef97ec84c3e3053455bddc2d1b6684f3ff237b7","abstract_canon_sha256":"ad5ce88509bcdb897b0909d7ea065382d7cb9284853c01c508e5d5e9550db01a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:56:26.935260Z","signature_b64":"9OJKOfMm3JrWxj37h1HkBWBhyNuMParKCbVh181xAWj9VDPScb2ziR/Q/abBoCV1rqnsA3hQoOKMCcR8NstoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fa8a895871c3a9e74038ef2b4931168059669bc08b0af71f718aa9785281676","last_reissued_at":"2026-07-05T01:56:26.934849Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:56:26.934849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Convenient Category for Higher-Order Probability Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO","math.CT","math.PR"],"primary_cat":"cs.PL","authors_text":"Chris Heunen, Hongseok Yang, Ohad Kammar, Sam Staton","submitted_at":"2017-01-10T12:19:05Z","abstract_excerpt":"Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of probability theory. Programs may use both higher-order functions and continuous distributions, or even define a probability distribution on functions. But standard probability theory does not handle higher-order functions well: the category of measurable spaces is not cartesian closed.\n  Here we introduce quasi-Borel spaces. We show that these spaces: form a new form"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02547","kind":"arxiv","version":4},"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/1701.02547/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.02547","created_at":"2026-07-05T01:56:26.934903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02547v4","created_at":"2026-07-05T01:56:26.934903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02547","created_at":"2026-07-05T01:56:26.934903+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6UKRFMHDQ5J","created_at":"2026-07-05T01:56:26.934903+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6UKRFMHDQ5J45AD","created_at":"2026-07-05T01:56:26.934903+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6UKRFMH","created_at":"2026-07-05T01:56:26.934903+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.05451","citing_title":"Compositional Inference Metaprogramming with Convergence Guarantees","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N6UKRFMHDQ5J45ADR3ZLJEYRNA","json":"https://pith.science/pith/N6UKRFMHDQ5J45ADR3ZLJEYRNA.json","graph_json":"https://pith.science/api/pith-number/N6UKRFMHDQ5J45ADR3ZLJEYRNA/graph.json","events_json":"https://pith.science/api/pith-number/N6UKRFMHDQ5J45ADR3ZLJEYRNA/events.json","paper":"https://pith.science/paper/N6UKRFMH"},"agent_actions":{"view_html":"https://pith.science/pith/N6UKRFMHDQ5J45ADR3ZLJEYRNA","download_json":"https://pith.science/pith/N6UKRFMHDQ5J45ADR3ZLJEYRNA.json","view_paper":"https://pith.science/paper/N6UKRFMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02547&json=true","fetch_graph":"https://pith.science/api/pith-number/N6UKRFMHDQ5J45ADR3ZLJEYRNA/graph.json","fetch_events":"https://pith.science/api/pith-number/N6UKRFMHDQ5J45ADR3ZLJEYRNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6UKRFMHDQ5J45ADR3ZLJEYRNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6UKRFMHDQ5J45ADR3ZLJEYRNA/action/storage_attestation","attest_author":"https://pith.science/pith/N6UKRFMHDQ5J45ADR3ZLJEYRNA/action/author_attestation","sign_citation":"https://pith.science/pith/N6UKRFMHDQ5J45ADR3ZLJEYRNA/action/citation_signature","submit_replication":"https://pith.science/pith/N6UKRFMHDQ5J45ADR3ZLJEYRNA/action/replication_record"}},"created_at":"2026-07-05T01:56:26.934903+00:00","updated_at":"2026-07-05T01:56:26.934903+00:00"}