{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MLBRJZOI7FDZOKFWGAOUR75FVM","short_pith_number":"pith:MLBRJZOI","canonical_record":{"source":{"id":"1211.1722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T23:12:00Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"b7742f4ac8aadbd7dff69d63dcac5b7a711c0569101aec2c29bcda94c131af61","abstract_canon_sha256":"5fa4d86edf22adb5e2e907dc4ae78b6f6135c0c1627b52305f204cfd7e5f3a47"},"schema_version":"1.0"},"canonical_sha256":"62c314e5c8f9479728b6301d48ffa5ab0d58eacba99ca2fad0dfcedc819f59ce","source":{"kind":"arxiv","id":"1211.1722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1722","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1722v1","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1722","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"pith_short_12","alias_value":"MLBRJZOI7FDZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MLBRJZOI7FDZOKFW","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MLBRJZOI","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MLBRJZOI7FDZOKFWGAOUR75FVM","target":"record","payload":{"canonical_record":{"source":{"id":"1211.1722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T23:12:00Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"b7742f4ac8aadbd7dff69d63dcac5b7a711c0569101aec2c29bcda94c131af61","abstract_canon_sha256":"5fa4d86edf22adb5e2e907dc4ae78b6f6135c0c1627b52305f204cfd7e5f3a47"},"schema_version":"1.0"},"canonical_sha256":"62c314e5c8f9479728b6301d48ffa5ab0d58eacba99ca2fad0dfcedc819f59ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:19.689029Z","signature_b64":"swGedylgGMeQok4mlxFzU3lClICPQO5Kp/bQ6o/xHhsm9LwUQUe5nFLU8YYCo0vMR6nVxM5M0efJ0BbkfRpfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62c314e5c8f9479728b6301d48ffa5ab0d58eacba99ca2fad0dfcedc819f59ce","last_reissued_at":"2026-05-18T03:41:19.688613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:19.688613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.1722","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLPjvfWC2ddXXmouevzcm/2FusyhvUc/8N5D3oAm8gpm8LgmdTQNcXquuKSTBBkySWY8Iv+YZMNDnRv0Qtp4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:53:59.491628Z"},"content_sha256":"4b35c748edfaa8374773224a10fffcddf4009d960d5d5b2092d70815982a3a28","schema_version":"1.0","event_id":"sha256:4b35c748edfaa8374773224a10fffcddf4009d960d5d5b2092d70815982a3a28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MLBRJZOI7FDZOKFWGAOUR75FVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inverse problems in approximate uniform generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Anindya De, Ilias Diakonikolas, Rocco A. Servedio","submitted_at":"2012-11-07T23:12:00Z","abstract_excerpt":"We initiate the study of \\emph{inverse} problems in approximate uniform generation, focusing on uniform generation of satisfying assignments of various types of Boolean functions. In such an inverse problem, the algorithm is given uniform random satisfying assignments of an unknown function $f$ belonging to a class $\\C$ of Boolean functions, and the goal is to output a probability distribution $D$ which is $\\epsilon$-close, in total variation distance, to the uniform distribution over $f^{-1}(1)$.\n  Positive results: We prove a general positive result establishing sufficient conditions for eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1722","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"So1M6kYP+uNsGWZ0I5o5PErMBI6qUfrA6onVK7ZcdzwvVx+Cz+LVN/8sl3VrRVGMHHygNduYIfzIiAjbiWsXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:53:59.492051Z"},"content_sha256":"60442876db821cf2a304b7731ff35a1e1b989a09a503872450f56bf1bb9f396b","schema_version":"1.0","event_id":"sha256:60442876db821cf2a304b7731ff35a1e1b989a09a503872450f56bf1bb9f396b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLBRJZOI7FDZOKFWGAOUR75FVM/bundle.json","state_url":"https://pith.science/pith/MLBRJZOI7FDZOKFWGAOUR75FVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLBRJZOI7FDZOKFWGAOUR75FVM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T00:53:59Z","links":{"resolver":"https://pith.science/pith/MLBRJZOI7FDZOKFWGAOUR75FVM","bundle":"https://pith.science/pith/MLBRJZOI7FDZOKFWGAOUR75FVM/bundle.json","state":"https://pith.science/pith/MLBRJZOI7FDZOKFWGAOUR75FVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLBRJZOI7FDZOKFWGAOUR75FVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MLBRJZOI7FDZOKFWGAOUR75FVM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5fa4d86edf22adb5e2e907dc4ae78b6f6135c0c1627b52305f204cfd7e5f3a47","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T23:12:00Z","title_canon_sha256":"b7742f4ac8aadbd7dff69d63dcac5b7a711c0569101aec2c29bcda94c131af61"},"schema_version":"1.0","source":{"id":"1211.1722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1722","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1722v1","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1722","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"pith_short_12","alias_value":"MLBRJZOI7FDZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MLBRJZOI7FDZOKFW","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MLBRJZOI","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:60442876db821cf2a304b7731ff35a1e1b989a09a503872450f56bf1bb9f396b","target":"graph","created_at":"2026-05-18T03:41:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We initiate the study of \\emph{inverse} problems in approximate uniform generation, focusing on uniform generation of satisfying assignments of various types of Boolean functions. In such an inverse problem, the algorithm is given uniform random satisfying assignments of an unknown function $f$ belonging to a class $\\C$ of Boolean functions, and the goal is to output a probability distribution $D$ which is $\\epsilon$-close, in total variation distance, to the uniform distribution over $f^{-1}(1)$.\n  Positive results: We prove a general positive result establishing sufficient conditions for eff","authors_text":"Anindya De, Ilias Diakonikolas, Rocco A. Servedio","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T23:12:00Z","title":"Inverse problems in approximate uniform generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1722","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4b35c748edfaa8374773224a10fffcddf4009d960d5d5b2092d70815982a3a28","target":"record","created_at":"2026-05-18T03:41:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5fa4d86edf22adb5e2e907dc4ae78b6f6135c0c1627b52305f204cfd7e5f3a47","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T23:12:00Z","title_canon_sha256":"b7742f4ac8aadbd7dff69d63dcac5b7a711c0569101aec2c29bcda94c131af61"},"schema_version":"1.0","source":{"id":"1211.1722","kind":"arxiv","version":1}},"canonical_sha256":"62c314e5c8f9479728b6301d48ffa5ab0d58eacba99ca2fad0dfcedc819f59ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62c314e5c8f9479728b6301d48ffa5ab0d58eacba99ca2fad0dfcedc819f59ce","first_computed_at":"2026-05-18T03:41:19.688613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:19.688613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"swGedylgGMeQok4mlxFzU3lClICPQO5Kp/bQ6o/xHhsm9LwUQUe5nFLU8YYCo0vMR6nVxM5M0efJ0BbkfRpfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:19.689029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b35c748edfaa8374773224a10fffcddf4009d960d5d5b2092d70815982a3a28","sha256:60442876db821cf2a304b7731ff35a1e1b989a09a503872450f56bf1bb9f396b"],"state_sha256":"163ffbb9bdc097120533270cc72dd7eb6021bed8585c6dda781a4bfc1fd608e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IlHAUp7AaMxhdI7IXa4+LFUCzv+DIoOF+J2TVq6w6GNWRHD7MZnpb5Pdd7BVMDepIQeMwJgSffM3fper/gsACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:53:59.495547Z","bundle_sha256":"10b59d4e9960ac5b299e3bcc95d89f6f074d1eea4736cb72747b0a6997e006f4"}}