{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R34RRKHRH7PPFMTIQ6U2I4XVYN","short_pith_number":"pith:R34RRKHR","schema_version":"1.0","canonical_sha256":"8ef918a8f13fdef2b26887a9a472f5c35d1c5ca0e36bcd7212af4858feb72ecd","source":{"kind":"arxiv","id":"1807.00507","version":1},"attestation_state":"computed","paper":{"title":"A SAT Encoding for the $n$-Fractions Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Michael Codish","submitted_at":"2018-07-02T07:54:17Z","abstract_excerpt":"This note describes a SAT encoding for the $n$-fractions puzzle which is problem 041 of the CSPLib. Using a SAT solver we obtain a solution for two of the six remaining open instances of this problem."},"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":"1807.00507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-02T07:54:17Z","cross_cats_sorted":[],"title_canon_sha256":"b08834824b74c0a9e85ead543ed2542b7564d0adfaebea44e0680f88a18fad52","abstract_canon_sha256":"d032df6c02221527d35da6f681591561a016ddd82ac900c17a1839f8799674bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:52.371199Z","signature_b64":"DgpnGVLI/z2gj/i+kZ2nUoVmbJBdfAzk2sRHl+Hhp4XxjkQcBzHaRSt9wccjnCM7qh8OMKKW5UDbJx6hb/SWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ef918a8f13fdef2b26887a9a472f5c35d1c5ca0e36bcd7212af4858feb72ecd","last_reissued_at":"2026-05-18T00:11:52.370502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:52.370502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A SAT Encoding for the $n$-Fractions Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Michael Codish","submitted_at":"2018-07-02T07:54:17Z","abstract_excerpt":"This note describes a SAT encoding for the $n$-fractions puzzle which is problem 041 of the CSPLib. Using a SAT solver we obtain a solution for two of the six remaining open instances of this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00507","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":"1807.00507","created_at":"2026-05-18T00:11:52.370605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00507v1","created_at":"2026-05-18T00:11:52.370605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00507","created_at":"2026-05-18T00:11:52.370605+00:00"},{"alias_kind":"pith_short_12","alias_value":"R34RRKHRH7PP","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R34RRKHRH7PPFMTI","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R34RRKHR","created_at":"2026-05-18T12:32:50.500415+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/R34RRKHRH7PPFMTIQ6U2I4XVYN","json":"https://pith.science/pith/R34RRKHRH7PPFMTIQ6U2I4XVYN.json","graph_json":"https://pith.science/api/pith-number/R34RRKHRH7PPFMTIQ6U2I4XVYN/graph.json","events_json":"https://pith.science/api/pith-number/R34RRKHRH7PPFMTIQ6U2I4XVYN/events.json","paper":"https://pith.science/paper/R34RRKHR"},"agent_actions":{"view_html":"https://pith.science/pith/R34RRKHRH7PPFMTIQ6U2I4XVYN","download_json":"https://pith.science/pith/R34RRKHRH7PPFMTIQ6U2I4XVYN.json","view_paper":"https://pith.science/paper/R34RRKHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00507&json=true","fetch_graph":"https://pith.science/api/pith-number/R34RRKHRH7PPFMTIQ6U2I4XVYN/graph.json","fetch_events":"https://pith.science/api/pith-number/R34RRKHRH7PPFMTIQ6U2I4XVYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R34RRKHRH7PPFMTIQ6U2I4XVYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R34RRKHRH7PPFMTIQ6U2I4XVYN/action/storage_attestation","attest_author":"https://pith.science/pith/R34RRKHRH7PPFMTIQ6U2I4XVYN/action/author_attestation","sign_citation":"https://pith.science/pith/R34RRKHRH7PPFMTIQ6U2I4XVYN/action/citation_signature","submit_replication":"https://pith.science/pith/R34RRKHRH7PPFMTIQ6U2I4XVYN/action/replication_record"}},"created_at":"2026-05-18T00:11:52.370605+00:00","updated_at":"2026-05-18T00:11:52.370605+00:00"}