{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CAWXVGTA5DH2YBMF3SOLKPHU6X","short_pith_number":"pith:CAWXVGTA","schema_version":"1.0","canonical_sha256":"102d7a9a60e8cfac0585dc9cb53cf4f5cd5848829333dd015e16fd71771eb8d7","source":{"kind":"arxiv","id":"1605.01622","version":1},"attestation_state":"computed","paper":{"title":"Improving abcdSAT by At-Least-One Recently Used Clause Management Strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Jingchao Chen","submitted_at":"2016-05-05T15:20:33Z","abstract_excerpt":"We improve further the 2015 version of abcdSAT by various heuristics such as at-least-one recently used strategy, learnt clause database approximation reduction etc. Based on the requirement of different tracks at the SAT Competition 2016, we develop three versions of abcdSAT: drup, inc and lim, which participate in the competition of main (agile), incremental library and no-limit track, respectively."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1605.01622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-05T15:20:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a01f9e376c9089767609b86f3ca22c87b83b156357fa1d6a56592f74382e6e0a","abstract_canon_sha256":"7de23f8d172eb30adf180f1cbd5e1ce725073695f764e3f7e52c857f5be9c485"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:33.137364Z","signature_b64":"SymfX6oxHch7uWcKYvmmfWQPZL2+9x5jhZfwYAFkjtd/G0COXapvDUoi40D4080aBW4whdlPYmM7g0mTw+PjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"102d7a9a60e8cfac0585dc9cb53cf4f5cd5848829333dd015e16fd71771eb8d7","last_reissued_at":"2026-05-18T01:15:33.136816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:33.136816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving abcdSAT by At-Least-One Recently Used Clause Management Strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Jingchao Chen","submitted_at":"2016-05-05T15:20:33Z","abstract_excerpt":"We improve further the 2015 version of abcdSAT by various heuristics such as at-least-one recently used strategy, learnt clause database approximation reduction etc. Based on the requirement of different tracks at the SAT Competition 2016, we develop three versions of abcdSAT: drup, inc and lim, which participate in the competition of main (agile), incremental library and no-limit track, respectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01622","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.01622","created_at":"2026-05-18T01:15:33.136882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01622v1","created_at":"2026-05-18T01:15:33.136882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01622","created_at":"2026-05-18T01:15:33.136882+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAWXVGTA5DH2","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAWXVGTA5DH2YBMF","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAWXVGTA","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CAWXVGTA5DH2YBMF3SOLKPHU6X","json":"https://pith.science/pith/CAWXVGTA5DH2YBMF3SOLKPHU6X.json","graph_json":"https://pith.science/api/pith-number/CAWXVGTA5DH2YBMF3SOLKPHU6X/graph.json","events_json":"https://pith.science/api/pith-number/CAWXVGTA5DH2YBMF3SOLKPHU6X/events.json","paper":"https://pith.science/paper/CAWXVGTA"},"agent_actions":{"view_html":"https://pith.science/pith/CAWXVGTA5DH2YBMF3SOLKPHU6X","download_json":"https://pith.science/pith/CAWXVGTA5DH2YBMF3SOLKPHU6X.json","view_paper":"https://pith.science/paper/CAWXVGTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01622&json=true","fetch_graph":"https://pith.science/api/pith-number/CAWXVGTA5DH2YBMF3SOLKPHU6X/graph.json","fetch_events":"https://pith.science/api/pith-number/CAWXVGTA5DH2YBMF3SOLKPHU6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAWXVGTA5DH2YBMF3SOLKPHU6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAWXVGTA5DH2YBMF3SOLKPHU6X/action/storage_attestation","attest_author":"https://pith.science/pith/CAWXVGTA5DH2YBMF3SOLKPHU6X/action/author_attestation","sign_citation":"https://pith.science/pith/CAWXVGTA5DH2YBMF3SOLKPHU6X/action/citation_signature","submit_replication":"https://pith.science/pith/CAWXVGTA5DH2YBMF3SOLKPHU6X/action/replication_record"}},"created_at":"2026-05-18T01:15:33.136882+00:00","updated_at":"2026-05-18T01:15:33.136882+00:00"}