{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:O2BVUX5IDRTHO5THESOEO67PDW","short_pith_number":"pith:O2BVUX5I","canonical_record":{"source":{"id":"1212.4548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-19T01:13:45Z","cross_cats_sorted":[],"title_canon_sha256":"f510d431bdfc7e19cac68ef27e25c97a6d9d7ad580b87b102055a28cbad315e8","abstract_canon_sha256":"e0a66ec648a63976e02db2b2107292f1e4dc5252496bdd385b321c5725ed9661"},"schema_version":"1.0"},"canonical_sha256":"76835a5fa81c66777667249c477bef1d9a372b50400c1231fb4cc445713a5667","source":{"kind":"arxiv","id":"1212.4548","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4548","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4548v2","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4548","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"O2BVUX5IDRTH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O2BVUX5IDRTHO5TH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O2BVUX5I","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:O2BVUX5IDRTHO5THESOEO67PDW","target":"record","payload":{"canonical_record":{"source":{"id":"1212.4548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-19T01:13:45Z","cross_cats_sorted":[],"title_canon_sha256":"f510d431bdfc7e19cac68ef27e25c97a6d9d7ad580b87b102055a28cbad315e8","abstract_canon_sha256":"e0a66ec648a63976e02db2b2107292f1e4dc5252496bdd385b321c5725ed9661"},"schema_version":"1.0"},"canonical_sha256":"76835a5fa81c66777667249c477bef1d9a372b50400c1231fb4cc445713a5667","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:42.655328Z","signature_b64":"LXTrXDANmgOBIua4BzOFivWWmxgATzlv26uzOPRXtd/CjfVNpdL3lA8O2WJqf4edG3iEGKSRc6vsQ6iYJVt4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76835a5fa81c66777667249c477bef1d9a372b50400c1231fb4cc445713a5667","last_reissued_at":"2026-05-18T03:27:42.654801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:42.654801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.4548","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-18T03:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CzbP16L3+UnP1SKuO5SZRfOr7GXyJE+mOwY57n0zFkMogNPHob8E6+pMMhL29/TtkZv9Tog8wr0VFlRfrzT2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:06:07.388195Z"},"content_sha256":"49bf9addfb72c0cad85fe5f9c3e442584b470ecb1618e1d613342169aacb5045","schema_version":"1.0","event_id":"sha256:49bf9addfb72c0cad85fe5f9c3e442584b470ecb1618e1d613342169aacb5045"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:O2BVUX5IDRTHO5THESOEO67PDW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ramamohan Paturi, Russell Impagliazzo, Stefan Schneider","submitted_at":"2012-12-19T01:13:45Z","abstract_excerpt":"We give a nontrivial algorithm for the satisfiability problem for cn-wire threshold circuits of depth two which is better than exhaustive search by a factor 2^{sn} where s= 1/c^{O(c^2)}. We believe that this is the first nontrivial satisfiability algorithm for cn-wire threshold circuits of depth two. The independently interesting problem of the feasibility of sparse 0-1 integer linear programs is a special case. To our knowledge, our algorithm is the first to achieve constant savings even for the special case of Integer Linear Programming. The key idea is to reduce the satisfiability problem t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4548","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-18T03:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZo4RdOyIfo3X18sJ7/iBtsXU9Hi0W8joMXZUWN0fhFHkPsVbYQKpR5nzZe/FzPeia7Vx0bxTej53VuXrMksAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:06:07.388563Z"},"content_sha256":"ae3c3b181ec1920548b541c49d04e1f1004cfe879204abf2fa9e29b5ebcf1533","schema_version":"1.0","event_id":"sha256:ae3c3b181ec1920548b541c49d04e1f1004cfe879204abf2fa9e29b5ebcf1533"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2BVUX5IDRTHO5THESOEO67PDW/bundle.json","state_url":"https://pith.science/pith/O2BVUX5IDRTHO5THESOEO67PDW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2BVUX5IDRTHO5THESOEO67PDW/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-03T23:06:07Z","links":{"resolver":"https://pith.science/pith/O2BVUX5IDRTHO5THESOEO67PDW","bundle":"https://pith.science/pith/O2BVUX5IDRTHO5THESOEO67PDW/bundle.json","state":"https://pith.science/pith/O2BVUX5IDRTHO5THESOEO67PDW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2BVUX5IDRTHO5THESOEO67PDW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:O2BVUX5IDRTHO5THESOEO67PDW","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":"e0a66ec648a63976e02db2b2107292f1e4dc5252496bdd385b321c5725ed9661","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-19T01:13:45Z","title_canon_sha256":"f510d431bdfc7e19cac68ef27e25c97a6d9d7ad580b87b102055a28cbad315e8"},"schema_version":"1.0","source":{"id":"1212.4548","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4548","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4548v2","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4548","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"O2BVUX5IDRTH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O2BVUX5IDRTHO5TH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O2BVUX5I","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:ae3c3b181ec1920548b541c49d04e1f1004cfe879204abf2fa9e29b5ebcf1533","target":"graph","created_at":"2026-05-18T03:27:42Z","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 give a nontrivial algorithm for the satisfiability problem for cn-wire threshold circuits of depth two which is better than exhaustive search by a factor 2^{sn} where s= 1/c^{O(c^2)}. We believe that this is the first nontrivial satisfiability algorithm for cn-wire threshold circuits of depth two. The independently interesting problem of the feasibility of sparse 0-1 integer linear programs is a special case. To our knowledge, our algorithm is the first to achieve constant savings even for the special case of Integer Linear Programming. The key idea is to reduce the satisfiability problem t","authors_text":"Ramamohan Paturi, Russell Impagliazzo, Stefan Schneider","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-19T01:13:45Z","title":"A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4548","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:49bf9addfb72c0cad85fe5f9c3e442584b470ecb1618e1d613342169aacb5045","target":"record","created_at":"2026-05-18T03:27:42Z","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":"e0a66ec648a63976e02db2b2107292f1e4dc5252496bdd385b321c5725ed9661","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-19T01:13:45Z","title_canon_sha256":"f510d431bdfc7e19cac68ef27e25c97a6d9d7ad580b87b102055a28cbad315e8"},"schema_version":"1.0","source":{"id":"1212.4548","kind":"arxiv","version":2}},"canonical_sha256":"76835a5fa81c66777667249c477bef1d9a372b50400c1231fb4cc445713a5667","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76835a5fa81c66777667249c477bef1d9a372b50400c1231fb4cc445713a5667","first_computed_at":"2026-05-18T03:27:42.654801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:42.654801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LXTrXDANmgOBIua4BzOFivWWmxgATzlv26uzOPRXtd/CjfVNpdL3lA8O2WJqf4edG3iEGKSRc6vsQ6iYJVt4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:42.655328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4548","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49bf9addfb72c0cad85fe5f9c3e442584b470ecb1618e1d613342169aacb5045","sha256:ae3c3b181ec1920548b541c49d04e1f1004cfe879204abf2fa9e29b5ebcf1533"],"state_sha256":"261ef97ae8c021d6581e463b6d449dbc6c4cccc4d5cac8586d420960e0c3030a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKPKx3XuOjkVA0aYsoyw8iKuybYrVWPTm7PK6WF/TJ5Y+nxoeKWlxEigkSyXlVWM1rsXW2JPDSnVaKoHkQCWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:06:07.390489Z","bundle_sha256":"b71f6fe5cd4a860dc7f4001743f0f8e1e092bb1cf9323b02ebe6f8a240079bd7"}}