{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3FYFO2MWN4XDZBGIE2MSD7Z6KT","short_pith_number":"pith:3FYFO2MW","canonical_record":{"source":{"id":"1506.01602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-04T14:18:54Z","cross_cats_sorted":[],"title_canon_sha256":"a12013423b122ab824e6b64541a6d4ef070ecab4e85aaac856833628d9121981","abstract_canon_sha256":"8dfebfb933e9d1fd058b5907f6521d534e4750fa7af150392f8799fd4cc1e73a"},"schema_version":"1.0"},"canonical_sha256":"d9705769966f2e3c84c8269921ff3e54c84b2c8cf3a150dc071536119ba01b64","source":{"kind":"arxiv","id":"1506.01602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01602","created_at":"2026-05-18T01:57:18Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01602v1","created_at":"2026-05-18T01:57:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01602","created_at":"2026-05-18T01:57:18Z"},{"alias_kind":"pith_short_12","alias_value":"3FYFO2MWN4XD","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FYFO2MWN4XDZBGI","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FYFO2MW","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3FYFO2MWN4XDZBGIE2MSD7Z6KT","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-04T14:18:54Z","cross_cats_sorted":[],"title_canon_sha256":"a12013423b122ab824e6b64541a6d4ef070ecab4e85aaac856833628d9121981","abstract_canon_sha256":"8dfebfb933e9d1fd058b5907f6521d534e4750fa7af150392f8799fd4cc1e73a"},"schema_version":"1.0"},"canonical_sha256":"d9705769966f2e3c84c8269921ff3e54c84b2c8cf3a150dc071536119ba01b64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:57:18.469217Z","signature_b64":"iCe9xLyj4areGjKAh684KEHR0+rv6+oyQlQSISzbc4o4LFtNmG289Khjgwtn/pqqbW3egfGUK8mVyhzq1H4YCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9705769966f2e3c84c8269921ff3e54c84b2c8cf3a150dc071536119ba01b64","last_reissued_at":"2026-05-18T01:57:18.468646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:57:18.468646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01602","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-18T01:57:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBaxEQLZYBLgZLTb7yTFOAlECyGcQLLu72O13KEDlrjwcGVvsOhUHjXLrkExV846qzaPUbohB/uJal8ICZsZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:12:40.557854Z"},"content_sha256":"ee5ba186732e991f460dce5e852d158cc4d31016801a6454c1fe8ff19e484168","schema_version":"1.0","event_id":"sha256:ee5ba186732e991f460dce5e852d158cc4d31016801a6454c1fe8ff19e484168"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3FYFO2MWN4XDZBGIE2MSD7Z6KT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Concurrency Problem with Exponential DPLL(T) Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alex Horn, Liana Hadarean, Tim King","submitted_at":"2015-06-04T14:18:54Z","abstract_excerpt":"Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is unsatisfiable once they have learned enough theory conflicts to derive a propositional contradiction. However some problems, such as the diamonds problem, require learning exponentially many conflicts. We give a general criterion for establishing lower bounds on the number of theory conflicts in any DPLL(T ) proof for a given problem. We apply our criterion to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01602","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-18T01:57:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sf8rolqVhs1Ui+hRivu2AvxcTiKhklDJ4N1dqme3nkU85WtPL84NnB/OzOmN5yo1maqooeZG+DDJrZvBSVw5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:12:40.558523Z"},"content_sha256":"a069b693732344c34faf333098440a413b8912ec9debd1b0f61243a0693bdef3","schema_version":"1.0","event_id":"sha256:a069b693732344c34faf333098440a413b8912ec9debd1b0f61243a0693bdef3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FYFO2MWN4XDZBGIE2MSD7Z6KT/bundle.json","state_url":"https://pith.science/pith/3FYFO2MWN4XDZBGIE2MSD7Z6KT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FYFO2MWN4XDZBGIE2MSD7Z6KT/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-10T05:12:40Z","links":{"resolver":"https://pith.science/pith/3FYFO2MWN4XDZBGIE2MSD7Z6KT","bundle":"https://pith.science/pith/3FYFO2MWN4XDZBGIE2MSD7Z6KT/bundle.json","state":"https://pith.science/pith/3FYFO2MWN4XDZBGIE2MSD7Z6KT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FYFO2MWN4XDZBGIE2MSD7Z6KT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3FYFO2MWN4XDZBGIE2MSD7Z6KT","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":"8dfebfb933e9d1fd058b5907f6521d534e4750fa7af150392f8799fd4cc1e73a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-04T14:18:54Z","title_canon_sha256":"a12013423b122ab824e6b64541a6d4ef070ecab4e85aaac856833628d9121981"},"schema_version":"1.0","source":{"id":"1506.01602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01602","created_at":"2026-05-18T01:57:18Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01602v1","created_at":"2026-05-18T01:57:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01602","created_at":"2026-05-18T01:57:18Z"},{"alias_kind":"pith_short_12","alias_value":"3FYFO2MWN4XD","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FYFO2MWN4XDZBGI","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FYFO2MW","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:a069b693732344c34faf333098440a413b8912ec9debd1b0f61243a0693bdef3","target":"graph","created_at":"2026-05-18T01:57:18Z","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":"Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is unsatisfiable once they have learned enough theory conflicts to derive a propositional contradiction. However some problems, such as the diamonds problem, require learning exponentially many conflicts. We give a general criterion for establishing lower bounds on the number of theory conflicts in any DPLL(T ) proof for a given problem. We apply our criterion to t","authors_text":"Alex Horn, Liana Hadarean, Tim King","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-04T14:18:54Z","title":"A Concurrency Problem with Exponential DPLL(T) Proofs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01602","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:ee5ba186732e991f460dce5e852d158cc4d31016801a6454c1fe8ff19e484168","target":"record","created_at":"2026-05-18T01:57:18Z","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":"8dfebfb933e9d1fd058b5907f6521d534e4750fa7af150392f8799fd4cc1e73a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-06-04T14:18:54Z","title_canon_sha256":"a12013423b122ab824e6b64541a6d4ef070ecab4e85aaac856833628d9121981"},"schema_version":"1.0","source":{"id":"1506.01602","kind":"arxiv","version":1}},"canonical_sha256":"d9705769966f2e3c84c8269921ff3e54c84b2c8cf3a150dc071536119ba01b64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9705769966f2e3c84c8269921ff3e54c84b2c8cf3a150dc071536119ba01b64","first_computed_at":"2026-05-18T01:57:18.468646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:57:18.468646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iCe9xLyj4areGjKAh684KEHR0+rv6+oyQlQSISzbc4o4LFtNmG289Khjgwtn/pqqbW3egfGUK8mVyhzq1H4YCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:57:18.469217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee5ba186732e991f460dce5e852d158cc4d31016801a6454c1fe8ff19e484168","sha256:a069b693732344c34faf333098440a413b8912ec9debd1b0f61243a0693bdef3"],"state_sha256":"50b1540d81bd9131f1dfa0d4930dc31f67862e85c4a448d7f72922cef0b0011c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBJcQ+EWlmvfMP0voZW63o/wGNfQsrQIvINxAYjxiDSKJSXJ2M2mNYefvSdrtMgUldbupz6yx388u1BgWQpNAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:12:40.561712Z","bundle_sha256":"abce6a0db47b8d7e8e38c3a7cf2c3f756ef6d0a44980184c8c9519378282c22c"}}