{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YPC766YEYWYARMMDGK3P4WJBZW","short_pith_number":"pith:YPC766YE","schema_version":"1.0","canonical_sha256":"c3c5ff7b04c5b008b18332b6fe5921cdb388297ab8677d7d0222aa4156ea5fe8","source":{"kind":"arxiv","id":"1307.5776","version":2},"attestation_state":"computed","paper":{"title":"An exact algorithm for 1-in-3 SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"\\'Edouard Bonnet, Vangelis Th. Paschos","submitted_at":"2013-07-22T17:02:36Z","abstract_excerpt":"1-in-3 SAT is an NP-complete variant of 3-SAT\\ where a \"clause\" is satisfied iff exactly one of its three literal is satisfied. We present here an exact algorithm solving \\oit\\ in time $O^*(1.260^n)$."},"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":"1307.5776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-22T17:02:36Z","cross_cats_sorted":[],"title_canon_sha256":"018dd1c428c080883f950d7584ee1305c4828911f50e87884bea2a4889d28728","abstract_canon_sha256":"8a39c0ce5dc9b9b05f39adaabf0d8beb60007a23de0279ebd14fb72565dc6a7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:24.053463Z","signature_b64":"fSwfIPC51Foe8wu8KogpzQr+18atx5wPq9gi48yznsgM3n8wGk06KeS5D1XJjRsG5AaFYPwTHrdiIWYz4DhYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3c5ff7b04c5b008b18332b6fe5921cdb388297ab8677d7d0222aa4156ea5fe8","last_reissued_at":"2026-05-18T03:17:24.053071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:24.053071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An exact algorithm for 1-in-3 SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"\\'Edouard Bonnet, Vangelis Th. Paschos","submitted_at":"2013-07-22T17:02:36Z","abstract_excerpt":"1-in-3 SAT is an NP-complete variant of 3-SAT\\ where a \"clause\" is satisfied iff exactly one of its three literal is satisfied. We present here an exact algorithm solving \\oit\\ in time $O^*(1.260^n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5776","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.5776","created_at":"2026-05-18T03:17:24.053138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5776v2","created_at":"2026-05-18T03:17:24.053138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5776","created_at":"2026-05-18T03:17:24.053138+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPC766YEYWYA","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPC766YEYWYARMMD","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPC766YE","created_at":"2026-05-18T12:28:09.283467+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/YPC766YEYWYARMMDGK3P4WJBZW","json":"https://pith.science/pith/YPC766YEYWYARMMDGK3P4WJBZW.json","graph_json":"https://pith.science/api/pith-number/YPC766YEYWYARMMDGK3P4WJBZW/graph.json","events_json":"https://pith.science/api/pith-number/YPC766YEYWYARMMDGK3P4WJBZW/events.json","paper":"https://pith.science/paper/YPC766YE"},"agent_actions":{"view_html":"https://pith.science/pith/YPC766YEYWYARMMDGK3P4WJBZW","download_json":"https://pith.science/pith/YPC766YEYWYARMMDGK3P4WJBZW.json","view_paper":"https://pith.science/paper/YPC766YE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5776&json=true","fetch_graph":"https://pith.science/api/pith-number/YPC766YEYWYARMMDGK3P4WJBZW/graph.json","fetch_events":"https://pith.science/api/pith-number/YPC766YEYWYARMMDGK3P4WJBZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPC766YEYWYARMMDGK3P4WJBZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPC766YEYWYARMMDGK3P4WJBZW/action/storage_attestation","attest_author":"https://pith.science/pith/YPC766YEYWYARMMDGK3P4WJBZW/action/author_attestation","sign_citation":"https://pith.science/pith/YPC766YEYWYARMMDGK3P4WJBZW/action/citation_signature","submit_replication":"https://pith.science/pith/YPC766YEYWYARMMDGK3P4WJBZW/action/replication_record"}},"created_at":"2026-05-18T03:17:24.053138+00:00","updated_at":"2026-05-18T03:17:24.053138+00:00"}