{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J5IIT5MGTGM5YLDGXNFSX2KW4F","short_pith_number":"pith:J5IIT5MG","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"},"canonical_sha256":"4f5089f5869999dc2c66bb4b2be956e154ad642ace42b8cfa1597cd33446606c","source":{"kind":"arxiv","id":"1808.10068","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10068","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10068v2","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10068","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"J5IIT5MGTGM5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J5IIT5MGTGM5YLDG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J5IIT5MG","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J5IIT5MGTGM5YLDGXNFSX2KW4F","target":"record","payload":{"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"},"canonical_sha256":"4f5089f5869999dc2c66bb4b2be956e154ad642ace42b8cfa1597cd33446606c","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"},"source_kind":"arxiv","source_id":"1808.10068","source_version":2,"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-18T00:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JlzjxMirL1L9Kkzva20Xn0ZWohd7oHG3KlEOyyLNUqe6K4KyJew9Qs0BKI5mMDIkp8KZpBzx556YjbO7oROnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:22:32.173401Z"},"content_sha256":"32cb0dc3afb901437dd0ac6d53ee351f02ee8db7baac0ffd897c34ec4b6e8920","schema_version":"1.0","event_id":"sha256:32cb0dc3afb901437dd0ac6d53ee351f02ee8db7baac0ffd897c34ec4b6e8920"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J5IIT5MGTGM5YLDGXNFSX2KW4F","target":"graph","payload":{"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"},"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-18T00:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFizSjiTQ0PP5NM5uF81uCFZCvLina9/BQAlVuHoliOtLZ10pMJHeMeAJMa7ovhf8AqDIIwOWweGlMrJhcLWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:22:32.173750Z"},"content_sha256":"d3fb368a99f63e09480c23c9c48b7c836d57c8ff739f99bf5a64211bf46d0215","schema_version":"1.0","event_id":"sha256:d3fb368a99f63e09480c23c9c48b7c836d57c8ff739f99bf5a64211bf46d0215"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F/bundle.json","state_url":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F/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-26T21:22:32Z","links":{"resolver":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F","bundle":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F/bundle.json","state":"https://pith.science/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5IIT5MGTGM5YLDGXNFSX2KW4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J5IIT5MGTGM5YLDGXNFSX2KW4F","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":"24d0036da12906d0c629a7b76f19fd28acf2a15b23cb5dc7dda52f55ab76eb30","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2018-08-29T23:34:17Z","title_canon_sha256":"f96e4ac7b2d788d2a9e5e73bf487f78d2194bfb76b5f3ca95b21aaf3044475e3"},"schema_version":"1.0","source":{"id":"1808.10068","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10068","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10068v2","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10068","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"J5IIT5MGTGM5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J5IIT5MGTGM5YLDG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J5IIT5MG","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:d3fb368a99f63e09480c23c9c48b7c836d57c8ff739f99bf5a64211bf46d0215","target":"graph","created_at":"2026-05-18T00:02:09Z","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":"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","authors_text":"Manuel Bodirsky, Marcello Mamino","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2018-08-29T23:34:17Z","title":"A polynomial-time algorithm for median-closed semilinear constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10068","kind":"arxiv","version":2},"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:32cb0dc3afb901437dd0ac6d53ee351f02ee8db7baac0ffd897c34ec4b6e8920","target":"record","created_at":"2026-05-18T00:02:09Z","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":"24d0036da12906d0c629a7b76f19fd28acf2a15b23cb5dc7dda52f55ab76eb30","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2018-08-29T23:34:17Z","title_canon_sha256":"f96e4ac7b2d788d2a9e5e73bf487f78d2194bfb76b5f3ca95b21aaf3044475e3"},"schema_version":"1.0","source":{"id":"1808.10068","kind":"arxiv","version":2}},"canonical_sha256":"4f5089f5869999dc2c66bb4b2be956e154ad642ace42b8cfa1597cd33446606c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f5089f5869999dc2c66bb4b2be956e154ad642ace42b8cfa1597cd33446606c","first_computed_at":"2026-05-18T00:02:09.170903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:09.170903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"js0z8K/HiSWLompVkCzJDOhTauK8IQgqq4ZhaPxpEeIrNg6713zgYmVipZ0uhuP9UQtaIHqfd9k7xRzhTgQjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:09.171611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10068","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32cb0dc3afb901437dd0ac6d53ee351f02ee8db7baac0ffd897c34ec4b6e8920","sha256:d3fb368a99f63e09480c23c9c48b7c836d57c8ff739f99bf5a64211bf46d0215"],"state_sha256":"fffeebbcbb20b2bf3b9d129fd5d10a2e477f4b942065048622b7f18c12b11e77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8JEVaJhlqVYx+R8h7A6gaJL262Wkrry5FIZqlP3rKxfQ5oweGvDSReq32HSamyn18a7Xax8u5ndekC1s8KybAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:22:32.175914Z","bundle_sha256":"db6f91c5d0acfc32090dafc93fa0ca7973f9f45bf8550b405c9fb1f0e0d4023a"}}