{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RAETGK44WXMUYOTMGAFT7HRNL6","short_pith_number":"pith:RAETGK44","schema_version":"1.0","canonical_sha256":"8809332b9cb5d94c3a6c300b3f9e2d5fbba40f4c26e3cfcfa4fada3569002609","source":{"kind":"arxiv","id":"1711.01943","version":1},"attestation_state":"computed","paper":{"title":"A new algorithm for constraint satisfaction problems with few subpowers templates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Amir El-Aooiti, Dejan Delic","submitted_at":"2017-11-03T04:34:35Z","abstract_excerpt":"In this article, we provide a new algorithm for solving constraint satisfaction problems over templates with few subpowers, by reducing the problem to the combination of solvability of a polynomial number of systems of linear equations over finite fields and reductions via absorbing subuniverses."},"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":"1711.01943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-11-03T04:34:35Z","cross_cats_sorted":[],"title_canon_sha256":"b3d2c9a437d17f14319951fb4c85796a86439c9674d6a0e9195a3f0255b0b952","abstract_canon_sha256":"4b835f04afb09c6a72d98b4af59340efa33b8a71e36dba8b4ecccbcf693e94aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:16.514953Z","signature_b64":"DiOAlgSUJ6dcS/dz7ncWXSE2OJ3eiHHWdK6SQruxbB8Nka/GDnbKN/Y0kQnerTA/UEvYoW+GpD7Dxjsz8aZYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8809332b9cb5d94c3a6c300b3f9e2d5fbba40f4c26e3cfcfa4fada3569002609","last_reissued_at":"2026-05-18T00:31:16.514480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:16.514480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new algorithm for constraint satisfaction problems with few subpowers templates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Amir El-Aooiti, Dejan Delic","submitted_at":"2017-11-03T04:34:35Z","abstract_excerpt":"In this article, we provide a new algorithm for solving constraint satisfaction problems over templates with few subpowers, by reducing the problem to the combination of solvability of a polynomial number of systems of linear equations over finite fields and reductions via absorbing subuniverses."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01943","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":"1711.01943","created_at":"2026-05-18T00:31:16.514556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01943v1","created_at":"2026-05-18T00:31:16.514556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01943","created_at":"2026-05-18T00:31:16.514556+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAETGK44WXMU","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAETGK44WXMUYOTM","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAETGK44","created_at":"2026-05-18T12:31:39.905425+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/RAETGK44WXMUYOTMGAFT7HRNL6","json":"https://pith.science/pith/RAETGK44WXMUYOTMGAFT7HRNL6.json","graph_json":"https://pith.science/api/pith-number/RAETGK44WXMUYOTMGAFT7HRNL6/graph.json","events_json":"https://pith.science/api/pith-number/RAETGK44WXMUYOTMGAFT7HRNL6/events.json","paper":"https://pith.science/paper/RAETGK44"},"agent_actions":{"view_html":"https://pith.science/pith/RAETGK44WXMUYOTMGAFT7HRNL6","download_json":"https://pith.science/pith/RAETGK44WXMUYOTMGAFT7HRNL6.json","view_paper":"https://pith.science/paper/RAETGK44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01943&json=true","fetch_graph":"https://pith.science/api/pith-number/RAETGK44WXMUYOTMGAFT7HRNL6/graph.json","fetch_events":"https://pith.science/api/pith-number/RAETGK44WXMUYOTMGAFT7HRNL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAETGK44WXMUYOTMGAFT7HRNL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAETGK44WXMUYOTMGAFT7HRNL6/action/storage_attestation","attest_author":"https://pith.science/pith/RAETGK44WXMUYOTMGAFT7HRNL6/action/author_attestation","sign_citation":"https://pith.science/pith/RAETGK44WXMUYOTMGAFT7HRNL6/action/citation_signature","submit_replication":"https://pith.science/pith/RAETGK44WXMUYOTMGAFT7HRNL6/action/replication_record"}},"created_at":"2026-05-18T00:31:16.514556+00:00","updated_at":"2026-05-18T00:31:16.514556+00:00"}