{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LNRZYNFIWO4XL2ZEWM7OJC4RJB","short_pith_number":"pith:LNRZYNFI","canonical_record":{"source":{"id":"1603.00082","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-29T22:45:49Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"318ae0e066816f34f1f615f6eb507ee2452dcbd4ec5f61b345faf981a5d912f7","abstract_canon_sha256":"78190065d22d6412c17df0a1cbf3a31c0197692eb91f8396fdd39d7f2eecbd8a"},"schema_version":"1.0"},"canonical_sha256":"5b639c34a8b3b975eb24b33ee48b914843a3c733c7da3264943d7a48947cf106","source":{"kind":"arxiv","id":"1603.00082","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00082","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00082v3","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00082","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"LNRZYNFIWO4X","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LNRZYNFIWO4XL2ZE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LNRZYNFI","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LNRZYNFIWO4XL2ZEWM7OJC4RJB","target":"record","payload":{"canonical_record":{"source":{"id":"1603.00082","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-29T22:45:49Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"318ae0e066816f34f1f615f6eb507ee2452dcbd4ec5f61b345faf981a5d912f7","abstract_canon_sha256":"78190065d22d6412c17df0a1cbf3a31c0197692eb91f8396fdd39d7f2eecbd8a"},"schema_version":"1.0"},"canonical_sha256":"5b639c34a8b3b975eb24b33ee48b914843a3c733c7da3264943d7a48947cf106","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:59.383813Z","signature_b64":"HQSvLugvgB34wcS7fQhuUvde1VbUkKde/GVW8iHt9f90zhcIX/CmlQP9DsqX1EgYfTyYwZiBDpdHsAglDZomCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b639c34a8b3b975eb24b33ee48b914843a3c733c7da3264943d7a48947cf106","last_reissued_at":"2026-05-18T01:03:59.383236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:59.383236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.00082","source_version":3,"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-05-18T01:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxSumEvzG/D2qCPxR2Z8YLNjarQzL2SyJdmx8BRIxXmOP3qD8eoSqx7DpbnZ9tRR2elqbJptQwRW1BqcMEi4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:37:31.300872Z"},"content_sha256":"a174f7cf289ab4aeaa1b93792ba0099e21460ff4f0cc071a107e9ea80bff88ed","schema_version":"1.0","event_id":"sha256:a174f7cf289ab4aeaa1b93792ba0099e21460ff4f0cc071a107e9ea80bff88ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LNRZYNFIWO4XL2ZEWM7OJC4RJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A complexity dichotomy for poset constraint satisfaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.CC","authors_text":"Michael Kompatscher, Trung Van Pham","submitted_at":"2016-02-29T22:45:49Z","abstract_excerpt":"In this paper we determine the complexity of a broad class of problems that extends the temporal constraint satisfaction problems. To be more precise we study the problems Poset-SAT($\\Phi$), where $\\Phi$ is a given set of quantifier-free $\\leq$-formulas. An instance of Poset-SAT($\\Phi$) consists of finitely many variables $x_1,\\ldots,x_n$ and formulas $\\phi_i(x_{i_1},\\ldots,x_{i_k})$ with $\\phi_i \\in \\Phi$; the question is whether this input is satisfied by any partial order on $x_1,\\ldots,x_n$ or not. We show that every such problem is NP-complete or can be solved in polynomial time, dependin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00082","kind":"arxiv","version":3},"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"},"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-05-18T01:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P05/l4ti4F1WV/o9nMRrg5NoDzwnIgz4MvY/DfRr0Ofe1NrPR3PfTcK/tu9cYId7jVw6zeLgDG9TA6xrUKUtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:37:31.301573Z"},"content_sha256":"8142671a52c32da9fc56bee9b636a162931991b8ba97239fdf51a39272fc8d12","schema_version":"1.0","event_id":"sha256:8142671a52c32da9fc56bee9b636a162931991b8ba97239fdf51a39272fc8d12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNRZYNFIWO4XL2ZEWM7OJC4RJB/bundle.json","state_url":"https://pith.science/pith/LNRZYNFIWO4XL2ZEWM7OJC4RJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNRZYNFIWO4XL2ZEWM7OJC4RJB/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-05-26T00:37:31Z","links":{"resolver":"https://pith.science/pith/LNRZYNFIWO4XL2ZEWM7OJC4RJB","bundle":"https://pith.science/pith/LNRZYNFIWO4XL2ZEWM7OJC4RJB/bundle.json","state":"https://pith.science/pith/LNRZYNFIWO4XL2ZEWM7OJC4RJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNRZYNFIWO4XL2ZEWM7OJC4RJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LNRZYNFIWO4XL2ZEWM7OJC4RJB","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":"78190065d22d6412c17df0a1cbf3a31c0197692eb91f8396fdd39d7f2eecbd8a","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-29T22:45:49Z","title_canon_sha256":"318ae0e066816f34f1f615f6eb507ee2452dcbd4ec5f61b345faf981a5d912f7"},"schema_version":"1.0","source":{"id":"1603.00082","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00082","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00082v3","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00082","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"LNRZYNFIWO4X","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LNRZYNFIWO4XL2ZE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LNRZYNFI","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:8142671a52c32da9fc56bee9b636a162931991b8ba97239fdf51a39272fc8d12","target":"graph","created_at":"2026-05-18T01:03:59Z","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"},"paper":{"abstract_excerpt":"In this paper we determine the complexity of a broad class of problems that extends the temporal constraint satisfaction problems. To be more precise we study the problems Poset-SAT($\\Phi$), where $\\Phi$ is a given set of quantifier-free $\\leq$-formulas. An instance of Poset-SAT($\\Phi$) consists of finitely many variables $x_1,\\ldots,x_n$ and formulas $\\phi_i(x_{i_1},\\ldots,x_{i_k})$ with $\\phi_i \\in \\Phi$; the question is whether this input is satisfied by any partial order on $x_1,\\ldots,x_n$ or not. We show that every such problem is NP-complete or can be solved in polynomial time, dependin","authors_text":"Michael Kompatscher, Trung Van Pham","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-29T22:45:49Z","title":"A complexity dichotomy for poset constraint satisfaction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00082","kind":"arxiv","version":3},"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:a174f7cf289ab4aeaa1b93792ba0099e21460ff4f0cc071a107e9ea80bff88ed","target":"record","created_at":"2026-05-18T01:03:59Z","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":"78190065d22d6412c17df0a1cbf3a31c0197692eb91f8396fdd39d7f2eecbd8a","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-29T22:45:49Z","title_canon_sha256":"318ae0e066816f34f1f615f6eb507ee2452dcbd4ec5f61b345faf981a5d912f7"},"schema_version":"1.0","source":{"id":"1603.00082","kind":"arxiv","version":3}},"canonical_sha256":"5b639c34a8b3b975eb24b33ee48b914843a3c733c7da3264943d7a48947cf106","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b639c34a8b3b975eb24b33ee48b914843a3c733c7da3264943d7a48947cf106","first_computed_at":"2026-05-18T01:03:59.383236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:59.383236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HQSvLugvgB34wcS7fQhuUvde1VbUkKde/GVW8iHt9f90zhcIX/CmlQP9DsqX1EgYfTyYwZiBDpdHsAglDZomCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:59.383813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.00082","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a174f7cf289ab4aeaa1b93792ba0099e21460ff4f0cc071a107e9ea80bff88ed","sha256:8142671a52c32da9fc56bee9b636a162931991b8ba97239fdf51a39272fc8d12"],"state_sha256":"1067d79936eec04807776e05f529ebbbfa7510809155d3fb322edfba468b8fc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2t7trLGZWs8rfaQoJ4Z24+lYbot+zacTs0VNIRbxmz1c4L3Nd+tQ1ttrT+TL8UZnkc9QhteaDz6yZ4wuQ1wOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:37:31.305448Z","bundle_sha256":"97230ed8f5b66d2cb0a1323bf52e3fec77fda9004fbc149327b07787f1702783"}}