{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BE656PDXZWQZ5WT5KQMGP3GPJT","short_pith_number":"pith:BE656PDX","schema_version":"1.0","canonical_sha256":"093ddf3c77cda19eda7d541867eccf4cd6ea5c875fd3e7d1cd58fa56b5e88940","source":{"kind":"arxiv","id":"2403.11348","version":1},"attestation_state":"computed","paper":{"title":"COLEP: Certifiably Robust Learning-Reasoning Conformal Prediction via Probabilistic Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Li, Linyi Li, Mintong Kang, Nezihe Merve G\\\"urel","submitted_at":"2024-03-17T21:23:45Z","abstract_excerpt":"Conformal prediction has shown spurring performance in constructing statistically rigorous prediction sets for arbitrary black-box machine learning models, assuming the data is exchangeable. However, even small adversarial perturbations during the inference can violate the exchangeability assumption, challenge the coverage guarantees, and result in a subsequent decline in empirical coverage. In this work, we propose a certifiably robust learning-reasoning conformal prediction framework (COLEP) via probabilistic circuits, which comprise a data-driven learning component that trains statistical m"},"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":"2403.11348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-17T21:23:45Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"17f8b6acfd3c480084ef10ee3494c2f0801ebe04e0fb0dd120680efe1df07538","abstract_canon_sha256":"33daa14873452c04a0c7bcaa8ebf63a4422fb9a025fdd574ec6fd194c627bd74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:15.079541Z","signature_b64":"/8+nEeaI+TFdhUb74h11kv4NescaiSrnVgvX2KRtxmS/ogCNAqtI+nmoXCFZvQHuPWgRLxCI08jHCVYHMvB6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"093ddf3c77cda19eda7d541867eccf4cd6ea5c875fd3e7d1cd58fa56b5e88940","last_reissued_at":"2026-07-05T07:57:15.079131Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:15.079131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"COLEP: Certifiably Robust Learning-Reasoning Conformal Prediction via Probabilistic Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Li, Linyi Li, Mintong Kang, Nezihe Merve G\\\"urel","submitted_at":"2024-03-17T21:23:45Z","abstract_excerpt":"Conformal prediction has shown spurring performance in constructing statistically rigorous prediction sets for arbitrary black-box machine learning models, assuming the data is exchangeable. However, even small adversarial perturbations during the inference can violate the exchangeability assumption, challenge the coverage guarantees, and result in a subsequent decline in empirical coverage. In this work, we propose a certifiably robust learning-reasoning conformal prediction framework (COLEP) via probabilistic circuits, which comprise a data-driven learning component that trains statistical m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.11348","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/2403.11348/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":"2403.11348","created_at":"2026-07-05T07:57:15.079192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.11348v1","created_at":"2026-07-05T07:57:15.079192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.11348","created_at":"2026-07-05T07:57:15.079192+00:00"},{"alias_kind":"pith_short_12","alias_value":"BE656PDXZWQZ","created_at":"2026-07-05T07:57:15.079192+00:00"},{"alias_kind":"pith_short_16","alias_value":"BE656PDXZWQZ5WT5","created_at":"2026-07-05T07:57:15.079192+00:00"},{"alias_kind":"pith_short_8","alias_value":"BE656PDX","created_at":"2026-07-05T07:57:15.079192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05141","citing_title":"Hardware-efficient tractable probabilistic inference for TinyML Neurosymbolic AI applications","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BE656PDXZWQZ5WT5KQMGP3GPJT","json":"https://pith.science/pith/BE656PDXZWQZ5WT5KQMGP3GPJT.json","graph_json":"https://pith.science/api/pith-number/BE656PDXZWQZ5WT5KQMGP3GPJT/graph.json","events_json":"https://pith.science/api/pith-number/BE656PDXZWQZ5WT5KQMGP3GPJT/events.json","paper":"https://pith.science/paper/BE656PDX"},"agent_actions":{"view_html":"https://pith.science/pith/BE656PDXZWQZ5WT5KQMGP3GPJT","download_json":"https://pith.science/pith/BE656PDXZWQZ5WT5KQMGP3GPJT.json","view_paper":"https://pith.science/paper/BE656PDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.11348&json=true","fetch_graph":"https://pith.science/api/pith-number/BE656PDXZWQZ5WT5KQMGP3GPJT/graph.json","fetch_events":"https://pith.science/api/pith-number/BE656PDXZWQZ5WT5KQMGP3GPJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BE656PDXZWQZ5WT5KQMGP3GPJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BE656PDXZWQZ5WT5KQMGP3GPJT/action/storage_attestation","attest_author":"https://pith.science/pith/BE656PDXZWQZ5WT5KQMGP3GPJT/action/author_attestation","sign_citation":"https://pith.science/pith/BE656PDXZWQZ5WT5KQMGP3GPJT/action/citation_signature","submit_replication":"https://pith.science/pith/BE656PDXZWQZ5WT5KQMGP3GPJT/action/replication_record"}},"created_at":"2026-07-05T07:57:15.079192+00:00","updated_at":"2026-07-05T07:57:15.079192+00:00"}