{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LITOT3CUVR32M3GB5PHMLPRQ5V","short_pith_number":"pith:LITOT3CU","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"},"canonical_sha256":"5a26e9ec54ac77a66cc1ebcec5be30ed65d3ece5ae3e54fe9c7b88da953bcecb","source":{"kind":"arxiv","id":"2508.14606","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.14606","created_at":"2026-07-05T11:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"2508.14606v1","created_at":"2026-07-05T11:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14606","created_at":"2026-07-05T11:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"LITOT3CUVR32","created_at":"2026-07-05T11:56:35Z"},{"alias_kind":"pith_short_16","alias_value":"LITOT3CUVR32M3GB","created_at":"2026-07-05T11:56:35Z"},{"alias_kind":"pith_short_8","alias_value":"LITOT3CU","created_at":"2026-07-05T11:56:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LITOT3CUVR32M3GB5PHMLPRQ5V","target":"record","payload":{"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"},"canonical_sha256":"5a26e9ec54ac77a66cc1ebcec5be30ed65d3ece5ae3e54fe9c7b88da953bcecb","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"},"source_kind":"arxiv","source_id":"2508.14606","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2sC5he4KrQzokWKt4hKDgvVEfvhqAJhJWWM1eMEBHm/r28aa3RDCShJonyzNo+wZQnd5mcFJf631gXMWqphDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T07:17:32.416646Z"},"content_sha256":"6a0f89ce181b570fed1cd10d597c82fff33b93dc087cb75cab7379ce90d92d66","schema_version":"1.0","event_id":"sha256:6a0f89ce181b570fed1cd10d597c82fff33b93dc087cb75cab7379ce90d92d66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LITOT3CUVR32M3GB5PHMLPRQ5V","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZDCzg5u3GmyX4YtD2bU5htGuJCue+tOwHxG8gICqTQ7RycIQl0r+NDcpWo1V8oH2tO/zDRetDtn7Zaq/iZHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T07:17:32.417244Z"},"content_sha256":"462015e3fbbde85afd1d4cf480197a785379de92c22869227c30cd6eea426c60","schema_version":"1.0","event_id":"sha256:462015e3fbbde85afd1d4cf480197a785379de92c22869227c30cd6eea426c60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V/bundle.json","state_url":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LITOT3CUVR32M3GB5PHMLPRQ5V/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T07:17:32Z","links":{"resolver":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V","bundle":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V/bundle.json","state":"https://pith.science/pith/LITOT3CUVR32M3GB5PHMLPRQ5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LITOT3CUVR32M3GB5PHMLPRQ5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LITOT3CUVR32M3GB5PHMLPRQ5V","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":"f3e25b06acbe5a325ba26b7344d62d363c48a052b20ab12bc989a9c317a605c6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-08-20T10:47:00Z","title_canon_sha256":"4f0e3deb3ee2fb666378d4fccf98ce84a4ac2d4bfb0151ddbe41f84bdb331549"},"schema_version":"1.0","source":{"id":"2508.14606","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.14606","created_at":"2026-07-05T11:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"2508.14606v1","created_at":"2026-07-05T11:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14606","created_at":"2026-07-05T11:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"LITOT3CUVR32","created_at":"2026-07-05T11:56:35Z"},{"alias_kind":"pith_short_16","alias_value":"LITOT3CUVR32M3GB","created_at":"2026-07-05T11:56:35Z"},{"alias_kind":"pith_short_8","alias_value":"LITOT3CU","created_at":"2026-07-05T11:56:35Z"}],"graph_snapshots":[{"event_id":"sha256:462015e3fbbde85afd1d4cf480197a785379de92c22869227c30cd6eea426c60","target":"graph","created_at":"2026-07-05T11:56:35Z","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/2508.14606/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Andrei Krokhin, Danny Vagnozzi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-08-20T10:47:00Z","title":"Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14606","kind":"arxiv","version":1},"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:6a0f89ce181b570fed1cd10d597c82fff33b93dc087cb75cab7379ce90d92d66","target":"record","created_at":"2026-07-05T11:56:35Z","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":"f3e25b06acbe5a325ba26b7344d62d363c48a052b20ab12bc989a9c317a605c6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-08-20T10:47:00Z","title_canon_sha256":"4f0e3deb3ee2fb666378d4fccf98ce84a4ac2d4bfb0151ddbe41f84bdb331549"},"schema_version":"1.0","source":{"id":"2508.14606","kind":"arxiv","version":1}},"canonical_sha256":"5a26e9ec54ac77a66cc1ebcec5be30ed65d3ece5ae3e54fe9c7b88da953bcecb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a26e9ec54ac77a66cc1ebcec5be30ed65d3ece5ae3e54fe9c7b88da953bcecb","first_computed_at":"2026-07-05T11:56:35.332613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:56:35.332613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l+ScTV9xantls+VquZ0QUfaMov8THwUBm+YJT1PHusevGiyVKtcR6k/8Z2xPn+iMcV0tgxM1Ad4q0z0aW+KICA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:56:35.333172Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.14606","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a0f89ce181b570fed1cd10d597c82fff33b93dc087cb75cab7379ce90d92d66","sha256:462015e3fbbde85afd1d4cf480197a785379de92c22869227c30cd6eea426c60"],"state_sha256":"7cdd06ac52de47b1df60b83008981351b196b7d27ac3fd71b6ad9cd9c2ec7489"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+3eKjAJcFZAOPp2ltxWFBxu1gQ7OhOpb7eJkTxntvaKl/EN5oXQDaqqGb2JZ2w42aJY+LVV0DOFIT7RgXS9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T07:17:32.421210Z","bundle_sha256":"7f8081a327398b314d579d636f2e9a39d5d6decccecd0628d0d43ac23821d80a"}}