{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NQSJHXT27I2DGFDIRROOMOL3BF","short_pith_number":"pith:NQSJHXT2","canonical_record":{"source":{"id":"1107.0268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-01T16:20:44Z","cross_cats_sorted":[],"title_canon_sha256":"0ade556380ec2583465a20bcdac6adf7124182517a2410dce46ef9a069167fd5","abstract_canon_sha256":"56d0376d22c78234e3118caf33b7f998aa3bdb94b2229a1ca35662c80f8576a8"},"schema_version":"1.0"},"canonical_sha256":"6c2493de7afa343314688c5ce6397b09690c722713f5835f163a3d79311a94b7","source":{"kind":"arxiv","id":"1107.0268","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0268","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0268v2","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0268","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"NQSJHXT27I2D","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NQSJHXT27I2DGFDI","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NQSJHXT2","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NQSJHXT27I2DGFDIRROOMOL3BF","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-01T16:20:44Z","cross_cats_sorted":[],"title_canon_sha256":"0ade556380ec2583465a20bcdac6adf7124182517a2410dce46ef9a069167fd5","abstract_canon_sha256":"56d0376d22c78234e3118caf33b7f998aa3bdb94b2229a1ca35662c80f8576a8"},"schema_version":"1.0"},"canonical_sha256":"6c2493de7afa343314688c5ce6397b09690c722713f5835f163a3d79311a94b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:33.096306Z","signature_b64":"JD32DPffAy++l/N1WSDngH08/gOJbNn/U8lPlJKPt2MR0zpaQmiPGBuc4SRFIJxvv8lsqBmDjTrX83CoxNftBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c2493de7afa343314688c5ce6397b09690c722713f5835f163a3d79311a94b7","last_reissued_at":"2026-05-18T04:06:33.095592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:33.095592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0268","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-18T04:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zgpy12nT8ztSNo8dNa3cbcb3Ohj4X95Quxl+FOmnbeGxPSLxwCn+buEtVgAaCF8DAcT5FSAmf2dU9423W2eaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:33:00.704680Z"},"content_sha256":"1c793d57cb592f753369c19e73f3a678445f35b24d5c79a89cce397cd687bb17","schema_version":"1.0","event_id":"sha256:1c793d57cb592f753369c19e73f3a678445f35b24d5c79a89cce397cd687bb17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NQSJHXT27I2DGFDIRROOMOL3BF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Algorithm Portfolio for SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Filip Maric, Mladen Nikolic, Predrag Janicic","submitted_at":"2011-07-01T16:20:44Z","abstract_excerpt":"The importance of algorithm portfolio techniques for SAT has long been noted, and a number of very successful systems have been devised, including the most successful one --- SATzilla. However, all these systems are quite complex (to understand, reimplement, or modify). In this paper we propose a new algorithm portfolio for SAT that is extremely simple, but in the same time so efficient that it outperforms SATzilla. For a new SAT instance to be solved, our portfolio finds its k-nearest neighbors from the training set and invokes a solver that performs the best at those instances. The main dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0268","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-18T04:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kmu612QboTvGCZNjpyOVM6UgP0fdayNPWIKuPn8+bDF6he6u2rWJxNXAdtlnxD/l0YwEvj5yj0d3+6Spp9ekDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:33:00.705028Z"},"content_sha256":"c30ff72b6eb04b120ef67c1dd42ebb4db199bbf346a6494e08dc3271afd66fd2","schema_version":"1.0","event_id":"sha256:c30ff72b6eb04b120ef67c1dd42ebb4db199bbf346a6494e08dc3271afd66fd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF/bundle.json","state_url":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQSJHXT27I2DGFDIRROOMOL3BF/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-22T12:33:00Z","links":{"resolver":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF","bundle":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF/bundle.json","state":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQSJHXT27I2DGFDIRROOMOL3BF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NQSJHXT27I2DGFDIRROOMOL3BF","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":"56d0376d22c78234e3118caf33b7f998aa3bdb94b2229a1ca35662c80f8576a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-01T16:20:44Z","title_canon_sha256":"0ade556380ec2583465a20bcdac6adf7124182517a2410dce46ef9a069167fd5"},"schema_version":"1.0","source":{"id":"1107.0268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0268","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0268v2","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0268","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"NQSJHXT27I2D","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NQSJHXT27I2DGFDI","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NQSJHXT2","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:c30ff72b6eb04b120ef67c1dd42ebb4db199bbf346a6494e08dc3271afd66fd2","target":"graph","created_at":"2026-05-18T04:06:33Z","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":"The importance of algorithm portfolio techniques for SAT has long been noted, and a number of very successful systems have been devised, including the most successful one --- SATzilla. However, all these systems are quite complex (to understand, reimplement, or modify). In this paper we propose a new algorithm portfolio for SAT that is extremely simple, but in the same time so efficient that it outperforms SATzilla. For a new SAT instance to be solved, our portfolio finds its k-nearest neighbors from the training set and invokes a solver that performs the best at those instances. The main dist","authors_text":"Filip Maric, Mladen Nikolic, Predrag Janicic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-01T16:20:44Z","title":"Simple Algorithm Portfolio for SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0268","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:1c793d57cb592f753369c19e73f3a678445f35b24d5c79a89cce397cd687bb17","target":"record","created_at":"2026-05-18T04:06:33Z","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":"56d0376d22c78234e3118caf33b7f998aa3bdb94b2229a1ca35662c80f8576a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-01T16:20:44Z","title_canon_sha256":"0ade556380ec2583465a20bcdac6adf7124182517a2410dce46ef9a069167fd5"},"schema_version":"1.0","source":{"id":"1107.0268","kind":"arxiv","version":2}},"canonical_sha256":"6c2493de7afa343314688c5ce6397b09690c722713f5835f163a3d79311a94b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c2493de7afa343314688c5ce6397b09690c722713f5835f163a3d79311a94b7","first_computed_at":"2026-05-18T04:06:33.095592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:33.095592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JD32DPffAy++l/N1WSDngH08/gOJbNn/U8lPlJKPt2MR0zpaQmiPGBuc4SRFIJxvv8lsqBmDjTrX83CoxNftBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:33.096306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c793d57cb592f753369c19e73f3a678445f35b24d5c79a89cce397cd687bb17","sha256:c30ff72b6eb04b120ef67c1dd42ebb4db199bbf346a6494e08dc3271afd66fd2"],"state_sha256":"d9285597e47f99f4e20383cae363e378025f5890790d7b3822439a187c152200"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZ/CVJybaXh3pwVFVo+a2g0rxUm6n6A6zDsRk6xeY9Ef4/P0UfEysRun6nMfmS3M96hTy2NrZ6o1yh6ZDakyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:33:00.707037Z","bundle_sha256":"e4aa3acd9f4bf8ea6fedc46ad95895ec35ac7942988838cbf00606d96c404101"}}