{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GB636MVOKGM47P2CVB57LCN7HR","short_pith_number":"pith:GB636MVO","canonical_record":{"source":{"id":"1505.01221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-05-05T23:39:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f97f279b3a58ebb74ff728aaf39a12ca2fba64192a2ab4e9e2efc5036056f48b","abstract_canon_sha256":"ed709468ce59637514a8ed013f808a596fc55977cc157eb3d51718b8ca61f8b6"},"schema_version":"1.0"},"canonical_sha256":"307dbf32ae5199cfbf42a87bf589bf3c5eb41b8a8803598dee71fd41923129b3","source":{"kind":"arxiv","id":"1505.01221","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01221","created_at":"2026-05-18T01:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01221v2","created_at":"2026-05-18T01:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01221","created_at":"2026-05-18T01:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"GB636MVOKGM4","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GB636MVOKGM47P2C","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GB636MVO","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GB636MVOKGM47P2CVB57LCN7HR","target":"record","payload":{"canonical_record":{"source":{"id":"1505.01221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-05-05T23:39:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f97f279b3a58ebb74ff728aaf39a12ca2fba64192a2ab4e9e2efc5036056f48b","abstract_canon_sha256":"ed709468ce59637514a8ed013f808a596fc55977cc157eb3d51718b8ca61f8b6"},"schema_version":"1.0"},"canonical_sha256":"307dbf32ae5199cfbf42a87bf589bf3c5eb41b8a8803598dee71fd41923129b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:10.635239Z","signature_b64":"m5TdDwm7euYAcOpPIYXTl5pNBF4d9j+v/1lhXLWgCRKOiTIiITXB166h/UaNyYnW1HOK1tvS5ZbAveHVuBcCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"307dbf32ae5199cfbf42a87bf589bf3c5eb41b8a8803598dee71fd41923129b3","last_reissued_at":"2026-05-18T01:10:10.634809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:10.634809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.01221","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-18T01:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2WElgTvH3/cN25YqPSYhtslc7bTl627GZA63pKlF5ebwCIu9+aYNbToSoOC/qIgjzvATip9vEI6uL56Wf4mDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:18:39.002507Z"},"content_sha256":"02781551637473d555bafde040905a0a7e33982301b88a73d0a6c157b2007eab","schema_version":"1.0","event_id":"sha256:02781551637473d555bafde040905a0a7e33982301b88a73d0a6c157b2007eab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GB636MVOKGM47P2CVB57LCN7HR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Configurable SAT Solver Challenge (CSSC)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Adrian Balint, Frank Hutter, Holger Hoos, Kevin Leyton-Brown, Marius Lindauer, Sam Bayless","submitted_at":"2015-05-05T23:39:24Z","abstract_excerpt":"It is well known that different solution strategies work well for different types of instances of hard combinatorial problems. As a consequence, most solvers for the propositional satisfiability problem (SAT) expose parameters that allow them to be customized to a particular family of instances. In the international SAT competition series, these parameters are ignored: solvers are run using a single default parameter setting (supplied by the authors) for all benchmark instances in a given track. While this competition format rewards solvers with robust default settings, it does not reflect the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01221","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-18T01:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQKPTrWiQoinY0zb+MQLHs1B1AAbpPdzLnrIDSddfjXGFfnZ6CJ20UjjRYgFdO3trFKqfMV9bgrs7zJM5L4PCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:18:39.002958Z"},"content_sha256":"e6bd0fc48b59c59e492382b6932ea3f76225dab259efa57f364824ef90f325c8","schema_version":"1.0","event_id":"sha256:e6bd0fc48b59c59e492382b6932ea3f76225dab259efa57f364824ef90f325c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GB636MVOKGM47P2CVB57LCN7HR/bundle.json","state_url":"https://pith.science/pith/GB636MVOKGM47P2CVB57LCN7HR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GB636MVOKGM47P2CVB57LCN7HR/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-02T02:18:39Z","links":{"resolver":"https://pith.science/pith/GB636MVOKGM47P2CVB57LCN7HR","bundle":"https://pith.science/pith/GB636MVOKGM47P2CVB57LCN7HR/bundle.json","state":"https://pith.science/pith/GB636MVOKGM47P2CVB57LCN7HR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GB636MVOKGM47P2CVB57LCN7HR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GB636MVOKGM47P2CVB57LCN7HR","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":"ed709468ce59637514a8ed013f808a596fc55977cc157eb3d51718b8ca61f8b6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-05-05T23:39:24Z","title_canon_sha256":"f97f279b3a58ebb74ff728aaf39a12ca2fba64192a2ab4e9e2efc5036056f48b"},"schema_version":"1.0","source":{"id":"1505.01221","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01221","created_at":"2026-05-18T01:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01221v2","created_at":"2026-05-18T01:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01221","created_at":"2026-05-18T01:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"GB636MVOKGM4","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GB636MVOKGM47P2C","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GB636MVO","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:e6bd0fc48b59c59e492382b6932ea3f76225dab259efa57f364824ef90f325c8","target":"graph","created_at":"2026-05-18T01:10:10Z","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":"It is well known that different solution strategies work well for different types of instances of hard combinatorial problems. As a consequence, most solvers for the propositional satisfiability problem (SAT) expose parameters that allow them to be customized to a particular family of instances. In the international SAT competition series, these parameters are ignored: solvers are run using a single default parameter setting (supplied by the authors) for all benchmark instances in a given track. While this competition format rewards solvers with robust default settings, it does not reflect the","authors_text":"Adrian Balint, Frank Hutter, Holger Hoos, Kevin Leyton-Brown, Marius Lindauer, Sam Bayless","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-05-05T23:39:24Z","title":"The Configurable SAT Solver Challenge (CSSC)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01221","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:02781551637473d555bafde040905a0a7e33982301b88a73d0a6c157b2007eab","target":"record","created_at":"2026-05-18T01:10:10Z","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":"ed709468ce59637514a8ed013f808a596fc55977cc157eb3d51718b8ca61f8b6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-05-05T23:39:24Z","title_canon_sha256":"f97f279b3a58ebb74ff728aaf39a12ca2fba64192a2ab4e9e2efc5036056f48b"},"schema_version":"1.0","source":{"id":"1505.01221","kind":"arxiv","version":2}},"canonical_sha256":"307dbf32ae5199cfbf42a87bf589bf3c5eb41b8a8803598dee71fd41923129b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"307dbf32ae5199cfbf42a87bf589bf3c5eb41b8a8803598dee71fd41923129b3","first_computed_at":"2026-05-18T01:10:10.634809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:10.634809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m5TdDwm7euYAcOpPIYXTl5pNBF4d9j+v/1lhXLWgCRKOiTIiITXB166h/UaNyYnW1HOK1tvS5ZbAveHVuBcCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:10.635239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01221","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02781551637473d555bafde040905a0a7e33982301b88a73d0a6c157b2007eab","sha256:e6bd0fc48b59c59e492382b6932ea3f76225dab259efa57f364824ef90f325c8"],"state_sha256":"45d9af328b9b4780d8bc389e64fcaf5efa4ba87c031f7988bd15d4267fdec054"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oza2YLtEeKtRvDgZBdGMTrCF7FXu77LdVMOPvDNs/y0qzeH5E+mtRkBS3kKLKNUyYX/T761Lv/kKZ7xd3zRyAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:18:39.005585Z","bundle_sha256":"75d981382567b2f019c5840c36d872f964de5280f8743dec576270308e99951a"}}