{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CVZUCIIDOMCZAXI4DA6TUY4LVY","short_pith_number":"pith:CVZUCIID","schema_version":"1.0","canonical_sha256":"15734121037305905d1c183d3a638bae1b558286214edb8b5991b64db36cc834","source":{"kind":"arxiv","id":"1707.06476","version":3},"attestation_state":"computed","paper":{"title":"The Inflation Technique Completely Solves the Causal Compatibility Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ME","stat.ML","stat.TH"],"primary_cat":"quant-ph","authors_text":"Elie Wolfe, Miguel Navascues","submitted_at":"2017-07-20T12:38:06Z","abstract_excerpt":"The causal compatibility question asks whether a given causal structure graph -- possibly involving latent variables -- constitutes a genuinely plausible causal explanation for a given probability distribution over the graph's observed variables. Algorithms predicated on merely necessary constraints for causal compatibility typically suffer from false negatives, i.e. they admit incompatible distributions as apparently compatible with the given graph. In [arXiv:1609.00672], one of us introduced the inflation technique for formulating useful relaxations of the causal compatibility problem in ter"},"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":"1707.06476","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-20T12:38:06Z","cross_cats_sorted":["math.ST","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"2e2a964049a4ef5826fc373c65dd7dbc90e74ae7a1863667935fab5876e239b8","abstract_canon_sha256":"f3a2c9ce997b9653bdbb9c8e2f75b9390e7e7df99fd452eb516c4e39f5858c13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:10:51.005476Z","signature_b64":"dW8m0cBOnckV5HyuSuu/fnyPmDDCAqxhWRHfbKw1je8Jfacy0C1BUTT0UR61GbeY0aWcI36SX2txTUy3s3b5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15734121037305905d1c183d3a638bae1b558286214edb8b5991b64db36cc834","last_reissued_at":"2026-07-05T05:10:51.004954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:10:51.004954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Inflation Technique Completely Solves the Causal Compatibility Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ME","stat.ML","stat.TH"],"primary_cat":"quant-ph","authors_text":"Elie Wolfe, Miguel Navascues","submitted_at":"2017-07-20T12:38:06Z","abstract_excerpt":"The causal compatibility question asks whether a given causal structure graph -- possibly involving latent variables -- constitutes a genuinely plausible causal explanation for a given probability distribution over the graph's observed variables. Algorithms predicated on merely necessary constraints for causal compatibility typically suffer from false negatives, i.e. they admit incompatible distributions as apparently compatible with the given graph. In [arXiv:1609.00672], one of us introduced the inflation technique for formulating useful relaxations of the causal compatibility problem in ter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06476","kind":"arxiv","version":3},"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/1707.06476/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":"1707.06476","created_at":"2026-07-05T05:10:51.005017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06476v3","created_at":"2026-07-05T05:10:51.005017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06476","created_at":"2026-07-05T05:10:51.005017+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVZUCIIDOMCZ","created_at":"2026-07-05T05:10:51.005017+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVZUCIIDOMCZAXI4","created_at":"2026-07-05T05:10:51.005017+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVZUCIID","created_at":"2026-07-05T05:10:51.005017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.12457","citing_title":"Experimental verification of multi-copy activation of genuine multipartite entanglement","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00981","citing_title":"The minimal example of quantum network Bell nonlocality","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CVZUCIIDOMCZAXI4DA6TUY4LVY","json":"https://pith.science/pith/CVZUCIIDOMCZAXI4DA6TUY4LVY.json","graph_json":"https://pith.science/api/pith-number/CVZUCIIDOMCZAXI4DA6TUY4LVY/graph.json","events_json":"https://pith.science/api/pith-number/CVZUCIIDOMCZAXI4DA6TUY4LVY/events.json","paper":"https://pith.science/paper/CVZUCIID"},"agent_actions":{"view_html":"https://pith.science/pith/CVZUCIIDOMCZAXI4DA6TUY4LVY","download_json":"https://pith.science/pith/CVZUCIIDOMCZAXI4DA6TUY4LVY.json","view_paper":"https://pith.science/paper/CVZUCIID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06476&json=true","fetch_graph":"https://pith.science/api/pith-number/CVZUCIIDOMCZAXI4DA6TUY4LVY/graph.json","fetch_events":"https://pith.science/api/pith-number/CVZUCIIDOMCZAXI4DA6TUY4LVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVZUCIIDOMCZAXI4DA6TUY4LVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVZUCIIDOMCZAXI4DA6TUY4LVY/action/storage_attestation","attest_author":"https://pith.science/pith/CVZUCIIDOMCZAXI4DA6TUY4LVY/action/author_attestation","sign_citation":"https://pith.science/pith/CVZUCIIDOMCZAXI4DA6TUY4LVY/action/citation_signature","submit_replication":"https://pith.science/pith/CVZUCIIDOMCZAXI4DA6TUY4LVY/action/replication_record"}},"created_at":"2026-07-05T05:10:51.005017+00:00","updated_at":"2026-07-05T05:10:51.005017+00:00"}