{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CQJSCSRVVWMLAL6XRDULRCSZLU","short_pith_number":"pith:CQJSCSRV","schema_version":"1.0","canonical_sha256":"1413214a35ad98b02fd788e8b88a595d30c18c7720a073be5acfd445f3158067","source":{"kind":"arxiv","id":"1602.07876","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.07876","created_at":"2026-05-18T01:19:58.367955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07876v1","created_at":"2026-05-18T01:19:58.367955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07876","created_at":"2026-05-18T01:19:58.367955+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQJSCSRVVWML","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQJSCSRVVWMLAL6X","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQJSCSRV","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU","json":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU.json","graph_json":"https://pith.science/api/pith-number/CQJSCSRVVWMLAL6XRDULRCSZLU/graph.json","events_json":"https://pith.science/api/pith-number/CQJSCSRVVWMLAL6XRDULRCSZLU/events.json","paper":"https://pith.science/paper/CQJSCSRV"},"agent_actions":{"view_html":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU","download_json":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU.json","view_paper":"https://pith.science/paper/CQJSCSRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07876&json=true","fetch_graph":"https://pith.science/api/pith-number/CQJSCSRVVWMLAL6XRDULRCSZLU/graph.json","fetch_events":"https://pith.science/api/pith-number/CQJSCSRVVWMLAL6XRDULRCSZLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU/action/storage_attestation","attest_author":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU/action/author_attestation","sign_citation":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU/action/citation_signature","submit_replication":"https://pith.science/pith/CQJSCSRVVWMLAL6XRDULRCSZLU/action/replication_record"}},"created_at":"2026-05-18T01:19:58.367955+00:00","updated_at":"2026-05-18T01:19:58.367955+00:00"}