{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CQJSCSRVVWMLAL6XRDULRCSZLU","short_pith_number":"pith:CQJSCSRV","canonical_record":{"source":{"id":"1602.07876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-25T10:40:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"748bdb707d00fc70757395ec79c50e53045b380683b426362218d6c1289981d5","abstract_canon_sha256":"d8207826c3d0c85f0d1698b61b5b2696979e16df5f19a552c81c97512ec0cf00"},"schema_version":"1.0"},"canonical_sha256":"1413214a35ad98b02fd788e8b88a595d30c18c7720a073be5acfd445f3158067","source":{"kind":"arxiv","id":"1602.07876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07876","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07876v1","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07876","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"pith_short_12","alias_value":"CQJSCSRVVWML","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CQJSCSRVVWMLAL6X","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CQJSCSRV","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CQJSCSRVVWMLAL6XRDULRCSZLU","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-25T10:40:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"748bdb707d00fc70757395ec79c50e53045b380683b426362218d6c1289981d5","abstract_canon_sha256":"d8207826c3d0c85f0d1698b61b5b2696979e16df5f19a552c81c97512ec0cf00"},"schema_version":"1.0"},"canonical_sha256":"1413214a35ad98b02fd788e8b88a595d30c18c7720a073be5acfd445f3158067","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:58.368556Z","signature_b64":"sprCMiR7F4coTulyNX7aWy1osGhvJQHeuc9cP2Pvb4DER6ZB6DUHDskNE9JPpYQhijaA0uXIKN5AQSDGTmHMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1413214a35ad98b02fd788e8b88a595d30c18c7720a073be5acfd445f3158067","last_reissued_at":"2026-05-18T01:19:58.367819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:58.367819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07876","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-05-18T01:19:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5hsQqDhWj7b9P4LVP14Emuvm8lZe2X8D7zebLl/zPxQrCr6NefbM60/1IJgKIbQbYZ5WhPn5k+lst8659+qBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:15:35.683135Z"},"content_sha256":"d70dbf6e65992a47bdf497561029d2d690f2330a037ff91c32a15e26bc905fb2","schema_version":"1.0","event_id":"sha256:d70dbf6e65992a47bdf497561029d2d690f2330a037ff91c32a15e26bc905fb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CQJSCSRVVWMLAL6XRDULRCSZLU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Satisfiability Problems with a Linear Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Christos Papadimitriou, Jan Arne Telle, Serge Gaspers, Sigve Hortemo Saether","submitted_at":"2016-02-25T10:40:28Z","abstract_excerpt":"It was recently shown \\cite{STV} that satisfiability is polynomially solvable when the incidence graph is an interval bipartite graph (an interval graph turned into a bipartite graph by omitting all edges within each partite set). Here we relax this condition in several directions: First, we show that it holds for $k$-interval bigraphs, bipartite graphs which can be converted to interval bipartite graphs by adding to each node of one side at most $k$ edges; the same result holds for the counting and the weighted maximization version of satisfiability. Second, given two linear orders, one for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07876","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":""},"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:19:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S7OcLmg8E446YSHpS4JQUJaLAtE2B3FfzdAGJaYcFS786iI9QIl1OMR1Oohwr+He2IgnOG0CuoBu1DiEDzv3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:15:35.683517Z"},"content_sha256":"68c3be9af5aa2f693ee49471e156f6dc94119385e625b921039860dd7272b4e5","schema_version":"1.0","event_id":"sha256:68c3be9af5aa2f693ee49471e156f6dc94119385e625b921039860dd7272b4e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU/bundle.json","state_url":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQJSCSRVVWMLAL6XRDULRCSZLU/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-31T01:15:35Z","links":{"resolver":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU","bundle":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU/bundle.json","state":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQJSCSRVVWMLAL6XRDULRCSZLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CQJSCSRVVWMLAL6XRDULRCSZLU","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":"d8207826c3d0c85f0d1698b61b5b2696979e16df5f19a552c81c97512ec0cf00","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-25T10:40:28Z","title_canon_sha256":"748bdb707d00fc70757395ec79c50e53045b380683b426362218d6c1289981d5"},"schema_version":"1.0","source":{"id":"1602.07876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07876","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07876v1","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07876","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"pith_short_12","alias_value":"CQJSCSRVVWML","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CQJSCSRVVWMLAL6X","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CQJSCSRV","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:68c3be9af5aa2f693ee49471e156f6dc94119385e625b921039860dd7272b4e5","target":"graph","created_at":"2026-05-18T01:19:58Z","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":"It was recently shown \\cite{STV} that satisfiability is polynomially solvable when the incidence graph is an interval bipartite graph (an interval graph turned into a bipartite graph by omitting all edges within each partite set). Here we relax this condition in several directions: First, we show that it holds for $k$-interval bigraphs, bipartite graphs which can be converted to interval bipartite graphs by adding to each node of one side at most $k$ edges; the same result holds for the counting and the weighted maximization version of satisfiability. Second, given two linear orders, one for t","authors_text":"Christos Papadimitriou, Jan Arne Telle, Serge Gaspers, Sigve Hortemo Saether","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-25T10:40:28Z","title":"On Satisfiability Problems with a Linear Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07876","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:d70dbf6e65992a47bdf497561029d2d690f2330a037ff91c32a15e26bc905fb2","target":"record","created_at":"2026-05-18T01:19:58Z","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":"d8207826c3d0c85f0d1698b61b5b2696979e16df5f19a552c81c97512ec0cf00","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-25T10:40:28Z","title_canon_sha256":"748bdb707d00fc70757395ec79c50e53045b380683b426362218d6c1289981d5"},"schema_version":"1.0","source":{"id":"1602.07876","kind":"arxiv","version":1}},"canonical_sha256":"1413214a35ad98b02fd788e8b88a595d30c18c7720a073be5acfd445f3158067","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1413214a35ad98b02fd788e8b88a595d30c18c7720a073be5acfd445f3158067","first_computed_at":"2026-05-18T01:19:58.367819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:58.367819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sprCMiR7F4coTulyNX7aWy1osGhvJQHeuc9cP2Pvb4DER6ZB6DUHDskNE9JPpYQhijaA0uXIKN5AQSDGTmHMCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:58.368556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d70dbf6e65992a47bdf497561029d2d690f2330a037ff91c32a15e26bc905fb2","sha256:68c3be9af5aa2f693ee49471e156f6dc94119385e625b921039860dd7272b4e5"],"state_sha256":"4b4d409b9fe09f8e89f8b1ce173ae419b331683abbdfffd4578ab8421d89ec25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1kaohDtUa5w0VWkKGXrIDotwuPTKST60Dc+QZt1omiMh1qq/Y6lgpq/vtGgu6jthpxGTKRZg4+4B8IeADF3bAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:15:35.686446Z","bundle_sha256":"2bc9b65dd7bbfe96bbf3fbccc5b2acb10756e328db2f099ac688b37dfb119d19"}}