{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KPRK264QU6GUCM6HAC3DYLQOII","short_pith_number":"pith:KPRK264Q","schema_version":"1.0","canonical_sha256":"53e2ad7b90a78d4133c700b63c2e0e42337a340ea32bc1ed3bf0ef09fc68cf3f","source":{"kind":"arxiv","id":"1607.04322","version":1},"attestation_state":"computed","paper":{"title":"Decidability of Non-Interactive Simulation of Joint Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Badih Ghazi, Madhu Sudan, Pritish Kamath","submitted_at":"2016-07-14T21:14:06Z","abstract_excerpt":"We present decidability results for a sub-class of \"non-interactive\" simulation problems, a well-studied class of problems in information theory. A non-interactive simulation problem is specified by two distributions $P(x,y)$ and $Q(u,v)$: The goal is to determine if two players, Alice and Bob, that observe sequences $X^n$ and $Y^n$ respectively where $\\{(X_i, Y_i)\\}_{i=1}^n$ are drawn i.i.d. from $P(x,y)$ can generate pairs $U$ and $V$ respectively (without communicating with each other) with a joint distribution that is arbitrarily close in total variation to $Q(u,v)$. Even when $P$ and $Q$ "},"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":"1607.04322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-14T21:14:06Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"6e1c515372617142b2f2a637c6d49297f64abdf0480cee045debe95697c0851b","abstract_canon_sha256":"b4f684b614d87da9b44ed41cadda449bb7d66ab8434a2fd9ae22e946b3197a66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:01.510562Z","signature_b64":"nzycifIhKbVW78NJKP7M76Q5kY7aMePTVER+kiPwWcI3CxfIZu52Y6K20cG2y0cHlWYiUM84LxO3lJpx1W33DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53e2ad7b90a78d4133c700b63c2e0e42337a340ea32bc1ed3bf0ef09fc68cf3f","last_reissued_at":"2026-05-18T01:11:01.509884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:01.509884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decidability of Non-Interactive Simulation of Joint Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Badih Ghazi, Madhu Sudan, Pritish Kamath","submitted_at":"2016-07-14T21:14:06Z","abstract_excerpt":"We present decidability results for a sub-class of \"non-interactive\" simulation problems, a well-studied class of problems in information theory. A non-interactive simulation problem is specified by two distributions $P(x,y)$ and $Q(u,v)$: The goal is to determine if two players, Alice and Bob, that observe sequences $X^n$ and $Y^n$ respectively where $\\{(X_i, Y_i)\\}_{i=1}^n$ are drawn i.i.d. from $P(x,y)$ can generate pairs $U$ and $V$ respectively (without communicating with each other) with a joint distribution that is arbitrarily close in total variation to $Q(u,v)$. Even when $P$ and $Q$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04322","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":"1607.04322","created_at":"2026-05-18T01:11:01.509967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04322v1","created_at":"2026-05-18T01:11:01.509967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04322","created_at":"2026-05-18T01:11:01.509967+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPRK264QU6GU","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPRK264QU6GUCM6H","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPRK264Q","created_at":"2026-05-18T12:30:25.849896+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/KPRK264QU6GUCM6HAC3DYLQOII","json":"https://pith.science/pith/KPRK264QU6GUCM6HAC3DYLQOII.json","graph_json":"https://pith.science/api/pith-number/KPRK264QU6GUCM6HAC3DYLQOII/graph.json","events_json":"https://pith.science/api/pith-number/KPRK264QU6GUCM6HAC3DYLQOII/events.json","paper":"https://pith.science/paper/KPRK264Q"},"agent_actions":{"view_html":"https://pith.science/pith/KPRK264QU6GUCM6HAC3DYLQOII","download_json":"https://pith.science/pith/KPRK264QU6GUCM6HAC3DYLQOII.json","view_paper":"https://pith.science/paper/KPRK264Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04322&json=true","fetch_graph":"https://pith.science/api/pith-number/KPRK264QU6GUCM6HAC3DYLQOII/graph.json","fetch_events":"https://pith.science/api/pith-number/KPRK264QU6GUCM6HAC3DYLQOII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPRK264QU6GUCM6HAC3DYLQOII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPRK264QU6GUCM6HAC3DYLQOII/action/storage_attestation","attest_author":"https://pith.science/pith/KPRK264QU6GUCM6HAC3DYLQOII/action/author_attestation","sign_citation":"https://pith.science/pith/KPRK264QU6GUCM6HAC3DYLQOII/action/citation_signature","submit_replication":"https://pith.science/pith/KPRK264QU6GUCM6HAC3DYLQOII/action/replication_record"}},"created_at":"2026-05-18T01:11:01.509967+00:00","updated_at":"2026-05-18T01:11:01.509967+00:00"}