{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YOSCDO5W4WWOY7PQTFPYLMYRMR","short_pith_number":"pith:YOSCDO5W","canonical_record":{"source":{"id":"1804.05507","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-16T05:29:21Z","cross_cats_sorted":[],"title_canon_sha256":"9f608cf9d7cf1a8379c80781c5178779b065be9dc6e33008dea0cf96149d9bfc","abstract_canon_sha256":"c4872234ce0754b6efe432bd3b6b16a755ce72494acc1695500ed735dcf5d50c"},"schema_version":"1.0"},"canonical_sha256":"c3a421bbb6e5acec7df0995f85b31164760a434ea1740a26a7bdd8e9f9e1030c","source":{"kind":"arxiv","id":"1804.05507","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05507","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05507v2","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05507","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"YOSCDO5W4WWO","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YOSCDO5W4WWOY7PQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YOSCDO5W","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YOSCDO5W4WWOY7PQTFPYLMYRMR","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05507","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-16T05:29:21Z","cross_cats_sorted":[],"title_canon_sha256":"9f608cf9d7cf1a8379c80781c5178779b065be9dc6e33008dea0cf96149d9bfc","abstract_canon_sha256":"c4872234ce0754b6efe432bd3b6b16a755ce72494acc1695500ed735dcf5d50c"},"schema_version":"1.0"},"canonical_sha256":"c3a421bbb6e5acec7df0995f85b31164760a434ea1740a26a7bdd8e9f9e1030c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:41.618025Z","signature_b64":"HGpveQ6sPHRWaZS7E8k+Jii0Ia9xFFZ4HacScwz5D24ieRn/jAAvU2Xyfrd2EE5HMZ3DLRRhTmeeWYl+CXADDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3a421bbb6e5acec7df0995f85b31164760a434ea1740a26a7bdd8e9f9e1030c","last_reissued_at":"2026-05-18T00:15:41.617481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:41.617481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05507","source_version":2,"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-18T00:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4DrTcTFT765glGx/KEdt4icvgRSF0hd4cZhfaPpja1gMErlenEkCHfVAxqylqRzOM6NBaDlvgECdrlSkPFhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:38:20.432249Z"},"content_sha256":"18decee60a13f7811d0892b10602320c36d46328085c7b3ae66cfded04072001","schema_version":"1.0","event_id":"sha256:18decee60a13f7811d0892b10602320c36d46328085c7b3ae66cfded04072001"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YOSCDO5W4WWOY7PQTFPYLMYRMR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"What's hard about Boolean Functional Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"S. Akshay, Shetal Shah, Shubham Goel, Sumith Kulal, Supratik Chakraborty","submitted_at":"2018-04-16T05:29:21Z","abstract_excerpt":"Given a relational specification between Boolean inputs and outputs, the goal of Boolean functional synthesis is to synthesize each output as a function of the inputs such that the specification is met. In this paper, we first show that unless some hard conjectures in complexity theory are falsified, Boolean functional synthesis must necessarily generate exponential-sized Skolem functions, thereby requiring exponential time, in the worst-case. Given this inherent hardness, what does one do to solve the problem? We present a two-phase algorithm for Boolean functional synthesis, where the first "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05507","kind":"arxiv","version":2},"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-18T00:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4nzTMIDz+KK4P25wKlsVvZ83R0W2GXLFQPR783eblnhyym/FDHtE4T3ebZO6YDcNoGNANkuYJaS0Q3eXGwDCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:38:20.432607Z"},"content_sha256":"d7fbbff78295a6fd1002502d370d926af06cc2c1c59e0df7b4501ee51a81d32a","schema_version":"1.0","event_id":"sha256:d7fbbff78295a6fd1002502d370d926af06cc2c1c59e0df7b4501ee51a81d32a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOSCDO5W4WWOY7PQTFPYLMYRMR/bundle.json","state_url":"https://pith.science/pith/YOSCDO5W4WWOY7PQTFPYLMYRMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOSCDO5W4WWOY7PQTFPYLMYRMR/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-02T21:38:20Z","links":{"resolver":"https://pith.science/pith/YOSCDO5W4WWOY7PQTFPYLMYRMR","bundle":"https://pith.science/pith/YOSCDO5W4WWOY7PQTFPYLMYRMR/bundle.json","state":"https://pith.science/pith/YOSCDO5W4WWOY7PQTFPYLMYRMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOSCDO5W4WWOY7PQTFPYLMYRMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YOSCDO5W4WWOY7PQTFPYLMYRMR","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":"c4872234ce0754b6efe432bd3b6b16a755ce72494acc1695500ed735dcf5d50c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-16T05:29:21Z","title_canon_sha256":"9f608cf9d7cf1a8379c80781c5178779b065be9dc6e33008dea0cf96149d9bfc"},"schema_version":"1.0","source":{"id":"1804.05507","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05507","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05507v2","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05507","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"YOSCDO5W4WWO","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YOSCDO5W4WWOY7PQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YOSCDO5W","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:d7fbbff78295a6fd1002502d370d926af06cc2c1c59e0df7b4501ee51a81d32a","target":"graph","created_at":"2026-05-18T00:15:41Z","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":"Given a relational specification between Boolean inputs and outputs, the goal of Boolean functional synthesis is to synthesize each output as a function of the inputs such that the specification is met. In this paper, we first show that unless some hard conjectures in complexity theory are falsified, Boolean functional synthesis must necessarily generate exponential-sized Skolem functions, thereby requiring exponential time, in the worst-case. Given this inherent hardness, what does one do to solve the problem? We present a two-phase algorithm for Boolean functional synthesis, where the first ","authors_text":"S. Akshay, Shetal Shah, Shubham Goel, Sumith Kulal, Supratik Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-16T05:29:21Z","title":"What's hard about Boolean Functional Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05507","kind":"arxiv","version":2},"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:18decee60a13f7811d0892b10602320c36d46328085c7b3ae66cfded04072001","target":"record","created_at":"2026-05-18T00:15:41Z","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":"c4872234ce0754b6efe432bd3b6b16a755ce72494acc1695500ed735dcf5d50c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-16T05:29:21Z","title_canon_sha256":"9f608cf9d7cf1a8379c80781c5178779b065be9dc6e33008dea0cf96149d9bfc"},"schema_version":"1.0","source":{"id":"1804.05507","kind":"arxiv","version":2}},"canonical_sha256":"c3a421bbb6e5acec7df0995f85b31164760a434ea1740a26a7bdd8e9f9e1030c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3a421bbb6e5acec7df0995f85b31164760a434ea1740a26a7bdd8e9f9e1030c","first_computed_at":"2026-05-18T00:15:41.617481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:41.617481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HGpveQ6sPHRWaZS7E8k+Jii0Ia9xFFZ4HacScwz5D24ieRn/jAAvU2Xyfrd2EE5HMZ3DLRRhTmeeWYl+CXADDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:41.618025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05507","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18decee60a13f7811d0892b10602320c36d46328085c7b3ae66cfded04072001","sha256:d7fbbff78295a6fd1002502d370d926af06cc2c1c59e0df7b4501ee51a81d32a"],"state_sha256":"19e2f95c3e1ded87053ce954cfc020acb1f7e4331c6d458a774b23ef9f77a5ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9vl+JqRn1VyBEbpfCmxtX5jBwcs1YzXXrYW3rVC4YmrmHQ6PMQj1+q2LVYj/d4MtqA9y+2aojQGSVQj+dbMgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:38:20.434741Z","bundle_sha256":"b95e4905d85b8a49be70e7cda1c54e347c50a61196026622679832216e26993e"}}