{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J5IIT5MGTGM5YLDGXNFSX2KW4F","short_pith_number":"pith:J5IIT5MG","schema_version":"1.0","canonical_sha256":"4f5089f5869999dc2c66bb4b2be956e154ad642ace42b8cfa1597cd33446606c","source":{"kind":"arxiv","id":"1808.10068","version":2},"attestation_state":"computed","paper":{"title":"A polynomial-time algorithm for median-closed semilinear constraints","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Manuel Bodirsky, Marcello Mamino","submitted_at":"2018-08-29T23:34:17Z","abstract_excerpt":"A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints are semilinear. When the sets are convex the CSP is polynomial-time equivalent to linear programming. A semilinear relation is convex if and only if it is preserved by taking averages. Our main result is a polynomial-time algorithm for the CSP of semilinear constraints that are preserved by applying medians. We also prove that this class is maximally tractable"},"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":"1808.10068","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2018-08-29T23:34:17Z","cross_cats_sorted":[],"title_canon_sha256":"f96e4ac7b2d788d2a9e5e73bf487f78d2194bfb76b5f3ca95b21aaf3044475e3","abstract_canon_sha256":"24d0036da12906d0c629a7b76f19fd28acf2a15b23cb5dc7dda52f55ab76eb30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:09.171611Z","signature_b64":"js0z8K/HiSWLompVkCzJDOhTauK8IQgqq4ZhaPxpEeIrNg6713zgYmVipZ0uhuP9UQtaIHqfd9k7xRzhTgQjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f5089f5869999dc2c66bb4b2be956e154ad642ace42b8cfa1597cd33446606c","last_reissued_at":"2026-05-18T00:02:09.170903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:09.170903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A polynomial-time algorithm for median-closed semilinear constraints","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Manuel Bodirsky, Marcello Mamino","submitted_at":"2018-08-29T23:34:17Z","abstract_excerpt":"A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints are semilinear. When the sets are convex the CSP is polynomial-time equivalent to linear programming. A semilinear relation is convex if and only if it is preserved by taking averages. Our main result is a polynomial-time algorithm for the CSP of semilinear constraints that are preserved by applying medians. We also prove that this class is maximally tractable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10068","kind":"arxiv","version":2},"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":"1808.10068","created_at":"2026-05-18T00:02:09.171011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10068v2","created_at":"2026-05-18T00:02:09.171011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10068","created_at":"2026-05-18T00:02:09.171011+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5IIT5MGTGM5","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5IIT5MGTGM5YLDG","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5IIT5MG","created_at":"2026-05-18T12:32:31.084164+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/J5IIT5MGTGM5YLDGXNFSX2KW4F","json":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F.json","graph_json":"https://pith.science/api/pith-number/J5IIT5MGTGM5YLDGXNFSX2KW4F/graph.json","events_json":"https://pith.science/api/pith-number/J5IIT5MGTGM5YLDGXNFSX2KW4F/events.json","paper":"https://pith.science/paper/J5IIT5MG"},"agent_actions":{"view_html":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F","download_json":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F.json","view_paper":"https://pith.science/paper/J5IIT5MG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10068&json=true","fetch_graph":"https://pith.science/api/pith-number/J5IIT5MGTGM5YLDGXNFSX2KW4F/graph.json","fetch_events":"https://pith.science/api/pith-number/J5IIT5MGTGM5YLDGXNFSX2KW4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F/action/storage_attestation","attest_author":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F/action/author_attestation","sign_citation":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F/action/citation_signature","submit_replication":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F/action/replication_record"}},"created_at":"2026-05-18T00:02:09.171011+00:00","updated_at":"2026-05-18T00:02:09.171011+00:00"}