{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FCYF3ITGUM2OAMEWJCXSKP7KEZ","short_pith_number":"pith:FCYF3ITG","canonical_record":{"source":{"id":"1901.05437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T18:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"dc5df91f090db69a19d8ebeb7f9b58b4f644f75db0dd890b597a9600cef187f4","abstract_canon_sha256":"71847758b364ca7f3ff715ac94891457f88429feb8f8ba90f0e9dce605c4672e"},"schema_version":"1.0"},"canonical_sha256":"28b05da266a334e0309648af253fea2648fd2672972f102a59f7717be7f24416","source":{"kind":"arxiv","id":"1901.05437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05437","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05437v1","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05437","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"FCYF3ITGUM2O","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FCYF3ITGUM2OAMEW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FCYF3ITG","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FCYF3ITGUM2OAMEWJCXSKP7KEZ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T18:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"dc5df91f090db69a19d8ebeb7f9b58b4f644f75db0dd890b597a9600cef187f4","abstract_canon_sha256":"71847758b364ca7f3ff715ac94891457f88429feb8f8ba90f0e9dce605c4672e"},"schema_version":"1.0"},"canonical_sha256":"28b05da266a334e0309648af253fea2648fd2672972f102a59f7717be7f24416","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:10.874386Z","signature_b64":"+mgLrY7CXZdk7lk8HV65UyHhGvEy+5v77tGqkRsq+k9s1/p5KrKd9KJU73CqSnGnuuO9VmOoCFTrJeIGfDNkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28b05da266a334e0309648af253fea2648fd2672972f102a59f7717be7f24416","last_reissued_at":"2026-05-17T23:56:10.873758Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:10.873758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05437","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-17T23:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"esqUi9SUJZBOu63hXZ9fyQehuV/POnZoiB9k3tqdVwIhMtMss8wB476KhDtXF8x70SRZ99NYbyAxMRdmpfwJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:08:31.344953Z"},"content_sha256":"0ea2deed707bf05f5f5734783ea04766e2b6f2b94bd1fd0a81f2b73a5d000bc1","schema_version":"1.0","event_id":"sha256:0ea2deed707bf05f5f5734783ea04766e2b6f2b94bd1fd0a81f2b73a5d000bc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FCYF3ITGUM2OAMEWJCXSKP7KEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Soft Constraints for Inference with Declarative Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Armando Solar Lezama, Edgar Minaysan, Javier Burroni, Rajesh Ranganath, Zenna Tavares","submitted_at":"2019-01-16T18:59:38Z","abstract_excerpt":"We develop a likelihood free inference procedure for conditioning a probabilistic model on a predicate. A predicate is a Boolean valued function which expresses a yes/no question about a domain. Our contribution, which we call predicate exchange, constructs a softened predicate which takes value in the unit interval [0, 1] as opposed to a simply true or false. Intuitively, 1 corresponds to true, and a high value (such as 0.999) corresponds to \"nearly true\" as determined by a distance metric. We define Boolean algebra for soft predicates, such that they can be negated, conjoined and disjoined a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05437","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-17T23:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTuLAfN0+5oETnbSY9HeQBVO9As1AQEsN5Li9hCSdI6f++6k939VM0iEkLe6pXQZzR7dFsYrXVW0hFjqlUVIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:08:31.345647Z"},"content_sha256":"7c50614aed48ef494114c44fa2bbb4cdb1a96740ee0a1f6f8170fa9b671c1c7b","schema_version":"1.0","event_id":"sha256:7c50614aed48ef494114c44fa2bbb4cdb1a96740ee0a1f6f8170fa9b671c1c7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCYF3ITGUM2OAMEWJCXSKP7KEZ/bundle.json","state_url":"https://pith.science/pith/FCYF3ITGUM2OAMEWJCXSKP7KEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCYF3ITGUM2OAMEWJCXSKP7KEZ/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-06-09T17:08:31Z","links":{"resolver":"https://pith.science/pith/FCYF3ITGUM2OAMEWJCXSKP7KEZ","bundle":"https://pith.science/pith/FCYF3ITGUM2OAMEWJCXSKP7KEZ/bundle.json","state":"https://pith.science/pith/FCYF3ITGUM2OAMEWJCXSKP7KEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCYF3ITGUM2OAMEWJCXSKP7KEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FCYF3ITGUM2OAMEWJCXSKP7KEZ","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":"71847758b364ca7f3ff715ac94891457f88429feb8f8ba90f0e9dce605c4672e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T18:59:38Z","title_canon_sha256":"dc5df91f090db69a19d8ebeb7f9b58b4f644f75db0dd890b597a9600cef187f4"},"schema_version":"1.0","source":{"id":"1901.05437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05437","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05437v1","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05437","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"FCYF3ITGUM2O","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FCYF3ITGUM2OAMEW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FCYF3ITG","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:7c50614aed48ef494114c44fa2bbb4cdb1a96740ee0a1f6f8170fa9b671c1c7b","target":"graph","created_at":"2026-05-17T23:56:10Z","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 develop a likelihood free inference procedure for conditioning a probabilistic model on a predicate. A predicate is a Boolean valued function which expresses a yes/no question about a domain. Our contribution, which we call predicate exchange, constructs a softened predicate which takes value in the unit interval [0, 1] as opposed to a simply true or false. Intuitively, 1 corresponds to true, and a high value (such as 0.999) corresponds to \"nearly true\" as determined by a distance metric. We define Boolean algebra for soft predicates, such that they can be negated, conjoined and disjoined a","authors_text":"Armando Solar Lezama, Edgar Minaysan, Javier Burroni, Rajesh Ranganath, Zenna Tavares","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T18:59:38Z","title":"Soft Constraints for Inference with Declarative Knowledge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05437","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:0ea2deed707bf05f5f5734783ea04766e2b6f2b94bd1fd0a81f2b73a5d000bc1","target":"record","created_at":"2026-05-17T23:56:10Z","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":"71847758b364ca7f3ff715ac94891457f88429feb8f8ba90f0e9dce605c4672e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T18:59:38Z","title_canon_sha256":"dc5df91f090db69a19d8ebeb7f9b58b4f644f75db0dd890b597a9600cef187f4"},"schema_version":"1.0","source":{"id":"1901.05437","kind":"arxiv","version":1}},"canonical_sha256":"28b05da266a334e0309648af253fea2648fd2672972f102a59f7717be7f24416","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28b05da266a334e0309648af253fea2648fd2672972f102a59f7717be7f24416","first_computed_at":"2026-05-17T23:56:10.873758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:10.873758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+mgLrY7CXZdk7lk8HV65UyHhGvEy+5v77tGqkRsq+k9s1/p5KrKd9KJU73CqSnGnuuO9VmOoCFTrJeIGfDNkAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:10.874386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ea2deed707bf05f5f5734783ea04766e2b6f2b94bd1fd0a81f2b73a5d000bc1","sha256:7c50614aed48ef494114c44fa2bbb4cdb1a96740ee0a1f6f8170fa9b671c1c7b"],"state_sha256":"d540454079d9e0e42806dd00ebe8810607f90643a423740f9f82b8eb7b7d424f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3TOigfP73k/ntlWGogSf1Prk3VVEhwai6Z7+XUtC8ZfndgtXW9BxTAoLn7TVOi5A1Pp+LJFr7CJlY4w1qVWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:08:31.349384Z","bundle_sha256":"95166408db788a3f3aad06ef495d46af21dcfe0d05e9df4514c2e018cd137e29"}}