{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QMIP3VNMTJSKS4VVLQYLSZL7UK","short_pith_number":"pith:QMIP3VNM","schema_version":"1.0","canonical_sha256":"8310fdd5ac9a64a972b55c30b9657fa28a0fe097fc513744b395f997e2621a11","source":{"kind":"arxiv","id":"2301.12977","version":4},"attestation_state":"computed","paper":{"title":"An order out of nowhere: a new algorithm for infinite-domain CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.LO"],"primary_cat":"cs.LO","authors_text":"Antoine Mottet, Michael Pinsker, Tom\\'a\\v{s} Nagy","submitted_at":"2023-01-30T15:23:50Z","abstract_excerpt":"We consider the problem of satisfiability of sets of constraints in a given set of finite uniform hypergraphs. While the problem under consideration is similar in nature to the problem of satisfiability of constraints in graphs, the classical complexity reduction to finite-domain CSPs that was used in the proof of the complexity dichotomy for such problems cannot be used as a black box in our case. We therefore introduce an algorithmic technique inspired by classical notions from the theory of finite-domain CSPs, and prove its correctness based on symmetries that depend on a linear order that "},"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":"2301.12977","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-01-30T15:23:50Z","cross_cats_sorted":["cs.CC","math.LO"],"title_canon_sha256":"0af206e58e7ea8680cec6d49b16b2ddb6ef08906dff7f59d73927ce05a680455","abstract_canon_sha256":"e94532e361471b15461cf7a87ad863ae1d7fae0fcd428f91bb48e25e50e53984"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:29.648214Z","signature_b64":"bT038kGES08JtCpne6A77Vqi1lEXCGREkfLK/umaRFi3qc8702rDGv8+xdF28hJLMy5lWmhskBeLeyw3Ofx1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8310fdd5ac9a64a972b55c30b9657fa28a0fe097fc513744b395f997e2621a11","last_reissued_at":"2026-07-05T11:57:29.647784Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:29.647784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An order out of nowhere: a new algorithm for infinite-domain CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.LO"],"primary_cat":"cs.LO","authors_text":"Antoine Mottet, Michael Pinsker, Tom\\'a\\v{s} Nagy","submitted_at":"2023-01-30T15:23:50Z","abstract_excerpt":"We consider the problem of satisfiability of sets of constraints in a given set of finite uniform hypergraphs. While the problem under consideration is similar in nature to the problem of satisfiability of constraints in graphs, the classical complexity reduction to finite-domain CSPs that was used in the proof of the complexity dichotomy for such problems cannot be used as a black box in our case. We therefore introduce an algorithmic technique inspired by classical notions from the theory of finite-domain CSPs, and prove its correctness based on symmetries that depend on a linear order that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.12977","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.12977/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2301.12977","created_at":"2026-07-05T11:57:29.647844+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.12977v4","created_at":"2026-07-05T11:57:29.647844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.12977","created_at":"2026-07-05T11:57:29.647844+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMIP3VNMTJSK","created_at":"2026-07-05T11:57:29.647844+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMIP3VNMTJSKS4VV","created_at":"2026-07-05T11:57:29.647844+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMIP3VNM","created_at":"2026-07-05T11:57:29.647844+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.16985","citing_title":"Structures with not too fast unlabelled growth","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QMIP3VNMTJSKS4VVLQYLSZL7UK","json":"https://pith.science/pith/QMIP3VNMTJSKS4VVLQYLSZL7UK.json","graph_json":"https://pith.science/api/pith-number/QMIP3VNMTJSKS4VVLQYLSZL7UK/graph.json","events_json":"https://pith.science/api/pith-number/QMIP3VNMTJSKS4VVLQYLSZL7UK/events.json","paper":"https://pith.science/paper/QMIP3VNM"},"agent_actions":{"view_html":"https://pith.science/pith/QMIP3VNMTJSKS4VVLQYLSZL7UK","download_json":"https://pith.science/pith/QMIP3VNMTJSKS4VVLQYLSZL7UK.json","view_paper":"https://pith.science/paper/QMIP3VNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.12977&json=true","fetch_graph":"https://pith.science/api/pith-number/QMIP3VNMTJSKS4VVLQYLSZL7UK/graph.json","fetch_events":"https://pith.science/api/pith-number/QMIP3VNMTJSKS4VVLQYLSZL7UK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMIP3VNMTJSKS4VVLQYLSZL7UK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMIP3VNMTJSKS4VVLQYLSZL7UK/action/storage_attestation","attest_author":"https://pith.science/pith/QMIP3VNMTJSKS4VVLQYLSZL7UK/action/author_attestation","sign_citation":"https://pith.science/pith/QMIP3VNMTJSKS4VVLQYLSZL7UK/action/citation_signature","submit_replication":"https://pith.science/pith/QMIP3VNMTJSKS4VVLQYLSZL7UK/action/replication_record"}},"created_at":"2026-07-05T11:57:29.647844+00:00","updated_at":"2026-07-05T11:57:29.647844+00:00"}