{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:QMIP3VNMTJSKS4VVLQYLSZL7UK","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":"e94532e361471b15461cf7a87ad863ae1d7fae0fcd428f91bb48e25e50e53984","cross_cats_sorted":["cs.CC","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-01-30T15:23:50Z","title_canon_sha256":"0af206e58e7ea8680cec6d49b16b2ddb6ef08906dff7f59d73927ce05a680455"},"schema_version":"1.0","source":{"id":"2301.12977","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.12977","created_at":"2026-07-05T11:57:29Z"},{"alias_kind":"arxiv_version","alias_value":"2301.12977v4","created_at":"2026-07-05T11:57:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.12977","created_at":"2026-07-05T11:57:29Z"},{"alias_kind":"pith_short_12","alias_value":"QMIP3VNMTJSK","created_at":"2026-07-05T11:57:29Z"},{"alias_kind":"pith_short_16","alias_value":"QMIP3VNMTJSKS4VV","created_at":"2026-07-05T11:57:29Z"},{"alias_kind":"pith_short_8","alias_value":"QMIP3VNM","created_at":"2026-07-05T11:57:29Z"}],"graph_snapshots":[{"event_id":"sha256:125403eedfb1438b107e79aea72815a653c8bbc9ad305f082c6c261d4a863eba","target":"graph","created_at":"2026-07-05T11:57:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.12977/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Antoine Mottet, Michael Pinsker, Tom\\'a\\v{s} Nagy","cross_cats":["cs.CC","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-01-30T15:23:50Z","title":"An order out of nowhere: a new algorithm for infinite-domain CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.12977","kind":"arxiv","version":4},"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:3ad500a3190f1b3ec499eb40573ae80738f23abac4e68ba951e83127a1797e8e","target":"record","created_at":"2026-07-05T11:57:29Z","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":"e94532e361471b15461cf7a87ad863ae1d7fae0fcd428f91bb48e25e50e53984","cross_cats_sorted":["cs.CC","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-01-30T15:23:50Z","title_canon_sha256":"0af206e58e7ea8680cec6d49b16b2ddb6ef08906dff7f59d73927ce05a680455"},"schema_version":"1.0","source":{"id":"2301.12977","kind":"arxiv","version":4}},"canonical_sha256":"8310fdd5ac9a64a972b55c30b9657fa28a0fe097fc513744b395f997e2621a11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8310fdd5ac9a64a972b55c30b9657fa28a0fe097fc513744b395f997e2621a11","first_computed_at":"2026-07-05T11:57:29.647784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:57:29.647784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bT038kGES08JtCpne6A77Vqi1lEXCGREkfLK/umaRFi3qc8702rDGv8+xdF28hJLMy5lWmhskBeLeyw3Ofx1Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:57:29.648214Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.12977","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ad500a3190f1b3ec499eb40573ae80738f23abac4e68ba951e83127a1797e8e","sha256:125403eedfb1438b107e79aea72815a653c8bbc9ad305f082c6c261d4a863eba"],"state_sha256":"2d043b620d87c6de8978a4a3fc6b56713ef29b698c9d5840565ec3b1d6a8cc62"}