{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U6QSMUUOXANLPFM2TDGXILBVLP","short_pith_number":"pith:U6QSMUUO","canonical_record":{"source":{"id":"1712.05513","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2017-12-15T03:03:11Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"7ed303ae2e91738f1a08a1bd567099e12f14c4b4299c07ad0f7226d673eb97c2","abstract_canon_sha256":"60dff6f2e80a016368074464f5ec24a77a77af58b1543b51f46097007a70e236"},"schema_version":"1.0"},"canonical_sha256":"a7a126528eb81ab7959a98cd742c355bc92ee3d1219a200f6a55a842db3a3d6c","source":{"kind":"arxiv","id":"1712.05513","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05513","created_at":"2026-05-18T00:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05513v3","created_at":"2026-05-18T00:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05513","created_at":"2026-05-18T00:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"U6QSMUUOXANL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6QSMUUOXANLPFM2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6QSMUUO","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U6QSMUUOXANLPFM2TDGXILBVLP","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05513","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2017-12-15T03:03:11Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"7ed303ae2e91738f1a08a1bd567099e12f14c4b4299c07ad0f7226d673eb97c2","abstract_canon_sha256":"60dff6f2e80a016368074464f5ec24a77a77af58b1543b51f46097007a70e236"},"schema_version":"1.0"},"canonical_sha256":"a7a126528eb81ab7959a98cd742c355bc92ee3d1219a200f6a55a842db3a3d6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:39.767444Z","signature_b64":"8TEHF3yKwvZoFCC8b/JgShk5rqPY0MmJzuw4OKtaRMAbt/rOBKaNsfFHefQ5sCvm0rrGJ9ZrqO0fD6z7DfgjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7a126528eb81ab7959a98cd742c355bc92ee3d1219a200f6a55a842db3a3d6c","last_reissued_at":"2026-05-18T00:04:39.766968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:39.766968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05513","source_version":3,"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:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b1NWBuCmNqcoSC3cVOmAML+bEfb+X5/9R0CwbNp8bjfqLpPVhDlNGaMjC2gaRyfFrOQZAFdvhaohl8gFPmzABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:13:54.981684Z"},"content_sha256":"5fd22086b6a6d3491c4de6c243fc7880b65876be050c7699c1b7724ae4e5a31a","schema_version":"1.0","event_id":"sha256:5fd22086b6a6d3491c4de6c243fc7880b65876be050c7699c1b7724ae4e5a31a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U6QSMUUOXANLPFM2TDGXILBVLP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Decidable Fragment of Second Order Logic With Applications to Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Mahesh Viswanathan, P. Madhusudan, Shambwaditya Saha, Umang Mathur","submitted_at":"2017-12-15T03:03:11Z","abstract_excerpt":"We propose a fragment of many-sorted second order logic called EQSMT and show that checking satisfiability of sentences in this fragment is decidable. EQSMT formulae have an $\\exists^*\\forall^*$ quantifier prefix (over variables, functions and relations) making EQSMT conducive for modeling synthesis problems. Moreover, EQSMT allows reasoning using a combination of background theories provided that they have a decidable satisfiability problem for the $\\exists^*\\forall^*$ FO-fragment (e.g., linear arithmetic). Our decision procedure reduces the satisfiability of EQSMT formulae to satisfiability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05513","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":""},"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:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/R7uLUFQY4xorR1kjW4iel3f5pDsu0XGAEnVdnRP8WRitPwsCdTX+wo4Umd7sAweZhXWo31osKsmHPlIvQJTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:13:54.982297Z"},"content_sha256":"e447d6e158047ac861fe989d4ec61922c4e3359a42ca5884babf9ebdd668633f","schema_version":"1.0","event_id":"sha256:e447d6e158047ac861fe989d4ec61922c4e3359a42ca5884babf9ebdd668633f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP/bundle.json","state_url":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6QSMUUOXANLPFM2TDGXILBVLP/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-06T22:13:54Z","links":{"resolver":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP","bundle":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP/bundle.json","state":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6QSMUUOXANLPFM2TDGXILBVLP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U6QSMUUOXANLPFM2TDGXILBVLP","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":"60dff6f2e80a016368074464f5ec24a77a77af58b1543b51f46097007a70e236","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2017-12-15T03:03:11Z","title_canon_sha256":"7ed303ae2e91738f1a08a1bd567099e12f14c4b4299c07ad0f7226d673eb97c2"},"schema_version":"1.0","source":{"id":"1712.05513","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05513","created_at":"2026-05-18T00:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05513v3","created_at":"2026-05-18T00:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05513","created_at":"2026-05-18T00:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"U6QSMUUOXANL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6QSMUUOXANLPFM2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6QSMUUO","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:e447d6e158047ac861fe989d4ec61922c4e3359a42ca5884babf9ebdd668633f","target":"graph","created_at":"2026-05-18T00:04:39Z","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 propose a fragment of many-sorted second order logic called EQSMT and show that checking satisfiability of sentences in this fragment is decidable. EQSMT formulae have an $\\exists^*\\forall^*$ quantifier prefix (over variables, functions and relations) making EQSMT conducive for modeling synthesis problems. Moreover, EQSMT allows reasoning using a combination of background theories provided that they have a decidable satisfiability problem for the $\\exists^*\\forall^*$ FO-fragment (e.g., linear arithmetic). Our decision procedure reduces the satisfiability of EQSMT formulae to satisfiability ","authors_text":"Mahesh Viswanathan, P. Madhusudan, Shambwaditya Saha, Umang Mathur","cross_cats":["cs.PL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2017-12-15T03:03:11Z","title":"A Decidable Fragment of Second Order Logic With Applications to Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05513","kind":"arxiv","version":3},"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:5fd22086b6a6d3491c4de6c243fc7880b65876be050c7699c1b7724ae4e5a31a","target":"record","created_at":"2026-05-18T00:04:39Z","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":"60dff6f2e80a016368074464f5ec24a77a77af58b1543b51f46097007a70e236","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2017-12-15T03:03:11Z","title_canon_sha256":"7ed303ae2e91738f1a08a1bd567099e12f14c4b4299c07ad0f7226d673eb97c2"},"schema_version":"1.0","source":{"id":"1712.05513","kind":"arxiv","version":3}},"canonical_sha256":"a7a126528eb81ab7959a98cd742c355bc92ee3d1219a200f6a55a842db3a3d6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7a126528eb81ab7959a98cd742c355bc92ee3d1219a200f6a55a842db3a3d6c","first_computed_at":"2026-05-18T00:04:39.766968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:39.766968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8TEHF3yKwvZoFCC8b/JgShk5rqPY0MmJzuw4OKtaRMAbt/rOBKaNsfFHefQ5sCvm0rrGJ9ZrqO0fD6z7DfgjCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:39.767444Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05513","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fd22086b6a6d3491c4de6c243fc7880b65876be050c7699c1b7724ae4e5a31a","sha256:e447d6e158047ac861fe989d4ec61922c4e3359a42ca5884babf9ebdd668633f"],"state_sha256":"e3c25ab5831767aeb4651430bc517c82e6a5c07fe537b493e9ba21dd7fe2f9f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cR/ctfT8OBPqcEpglYThQZDDy56UY7HWPfSoLHeatOZdK9rwUe9K25YZJdxVXxBkZbfs8WkKIjXQ0NfxxRX6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:13:54.987464Z","bundle_sha256":"04570e23902007260474f307ef46ce8051462d88e3c233dba2fe1c4d506fa4f6"}}