{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LITOT3CUVR32M3GB5PHMLPRQ5V","short_pith_number":"pith:LITOT3CU","schema_version":"1.0","canonical_sha256":"5a26e9ec54ac77a66cc1ebcec5be30ed65d3ece5ae3e54fe9c7b88da953bcecb","source":{"kind":"arxiv","id":"2508.14606","version":1},"attestation_state":"computed","paper":{"title":"Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrei Krokhin, Danny Vagnozzi","submitted_at":"2025-08-20T10:47:00Z","abstract_excerpt":"Given a satisfiable instance of 1-in-3 SAT, it is NP-hard to find a satisfying assignment for it, but it may be possible to efficiently find a solution subject to a weaker (not necessarily Boolean) predicate than `1-in-3'. There is a folklore conjecture predicting which choices of weaker predicates lead to tractability and for which the task remains \\NP-hard. One specific predicate, corresponding to the problem of linearly ordered $3$-colouring of 3-uniform hypergraphs, has been mentioned in several recent papers as an obstacle to further progress in proving this conjecture. We prove that the "},"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":"2508.14606","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-08-20T10:47:00Z","cross_cats_sorted":[],"title_canon_sha256":"4f0e3deb3ee2fb666378d4fccf98ce84a4ac2d4bfb0151ddbe41f84bdb331549","abstract_canon_sha256":"f3e25b06acbe5a325ba26b7344d62d363c48a052b20ab12bc989a9c317a605c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:35.333172Z","signature_b64":"l+ScTV9xantls+VquZ0QUfaMov8THwUBm+YJT1PHusevGiyVKtcR6k/8Z2xPn+iMcV0tgxM1Ad4q0z0aW+KICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a26e9ec54ac77a66cc1ebcec5be30ed65d3ece5ae3e54fe9c7b88da953bcecb","last_reissued_at":"2026-07-05T11:56:35.332613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:35.332613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrei Krokhin, Danny Vagnozzi","submitted_at":"2025-08-20T10:47:00Z","abstract_excerpt":"Given a satisfiable instance of 1-in-3 SAT, it is NP-hard to find a satisfying assignment for it, but it may be possible to efficiently find a solution subject to a weaker (not necessarily Boolean) predicate than `1-in-3'. There is a folklore conjecture predicting which choices of weaker predicates lead to tractability and for which the task remains \\NP-hard. One specific predicate, corresponding to the problem of linearly ordered $3$-colouring of 3-uniform hypergraphs, has been mentioned in several recent papers as an obstacle to further progress in proving this conjecture. We prove that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14606","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.14606/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":"2508.14606","created_at":"2026-07-05T11:56:35.332679+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14606v1","created_at":"2026-07-05T11:56:35.332679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14606","created_at":"2026-07-05T11:56:35.332679+00:00"},{"alias_kind":"pith_short_12","alias_value":"LITOT3CUVR32","created_at":"2026-07-05T11:56:35.332679+00:00"},{"alias_kind":"pith_short_16","alias_value":"LITOT3CUVR32M3GB","created_at":"2026-07-05T11:56:35.332679+00:00"},{"alias_kind":"pith_short_8","alias_value":"LITOT3CU","created_at":"2026-07-05T11:56:35.332679+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09815","citing_title":"Towards infinite PCSP: a dichotomy for monochromatic cliques","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V","json":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V.json","graph_json":"https://pith.science/api/pith-number/LITOT3CUVR32M3GB5PHMLPRQ5V/graph.json","events_json":"https://pith.science/api/pith-number/LITOT3CUVR32M3GB5PHMLPRQ5V/events.json","paper":"https://pith.science/paper/LITOT3CU"},"agent_actions":{"view_html":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V","download_json":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V.json","view_paper":"https://pith.science/paper/LITOT3CU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14606&json=true","fetch_graph":"https://pith.science/api/pith-number/LITOT3CUVR32M3GB5PHMLPRQ5V/graph.json","fetch_events":"https://pith.science/api/pith-number/LITOT3CUVR32M3GB5PHMLPRQ5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V/action/storage_attestation","attest_author":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V/action/author_attestation","sign_citation":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V/action/citation_signature","submit_replication":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V/action/replication_record"}},"created_at":"2026-07-05T11:56:35.332679+00:00","updated_at":"2026-07-05T11:56:35.332679+00:00"}