{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YDJZXX62JXSPTRSZAXWKVFIWDY","short_pith_number":"pith:YDJZXX62","schema_version":"1.0","canonical_sha256":"c0d39bdfda4de4f9c65905ecaa95161e3a89928e7544db2faece1355a05c210b","source":{"kind":"arxiv","id":"1710.04533","version":2},"attestation_state":"computed","paper":{"title":"On the Containment Problem for Linear Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Hans U. Simon","submitted_at":"2017-10-12T14:15:45Z","abstract_excerpt":"It is well known that the containment problem (as well as the equivalence problem) for semilinear sets is $\\log$-complete in $\\Pi_2^p$. It had been shown quite recently that already the containment problem for multi-dimensional linear sets is $\\log$-complete in $\\Pi_2^p$ (where hardness even holds for a unary encoding of the numerical input parameters). In this paper, we show that already the containment problem for $1$-dimensional linear sets (with binary encoding of the numerical input parameters) is $\\log$-hard (and therefore also $\\log$-complete) in $\\Pi_2^p$. However, combining both restr"},"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":"1710.04533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-12T14:15:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f95df968c14bf77663bec96638a983cc272ab436bb088c94333e4ffb0a770f3d","abstract_canon_sha256":"4210ed9db0099da123524d180d4092ececb0178d10255bbc29baf86dfcccb3a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:58.365160Z","signature_b64":"TuS7EASrfZX6G+3U8ZZ0Y5XXUBRcEGKe6YrAJUmZLdlhrC9/4tj0Mq7PFcYqFhIijxnpp/E4fo72CPRXLqG6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0d39bdfda4de4f9c65905ecaa95161e3a89928e7544db2faece1355a05c210b","last_reissued_at":"2026-05-18T00:22:58.364654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:58.364654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Containment Problem for Linear Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Hans U. Simon","submitted_at":"2017-10-12T14:15:45Z","abstract_excerpt":"It is well known that the containment problem (as well as the equivalence problem) for semilinear sets is $\\log$-complete in $\\Pi_2^p$. It had been shown quite recently that already the containment problem for multi-dimensional linear sets is $\\log$-complete in $\\Pi_2^p$ (where hardness even holds for a unary encoding of the numerical input parameters). In this paper, we show that already the containment problem for $1$-dimensional linear sets (with binary encoding of the numerical input parameters) is $\\log$-hard (and therefore also $\\log$-complete) in $\\Pi_2^p$. However, combining both restr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04533","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":"1710.04533","created_at":"2026-05-18T00:22:58.364739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04533v2","created_at":"2026-05-18T00:22:58.364739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04533","created_at":"2026-05-18T00:22:58.364739+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDJZXX62JXSP","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDJZXX62JXSPTRSZ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDJZXX62","created_at":"2026-05-18T12:31:56.362134+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/YDJZXX62JXSPTRSZAXWKVFIWDY","json":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY.json","graph_json":"https://pith.science/api/pith-number/YDJZXX62JXSPTRSZAXWKVFIWDY/graph.json","events_json":"https://pith.science/api/pith-number/YDJZXX62JXSPTRSZAXWKVFIWDY/events.json","paper":"https://pith.science/paper/YDJZXX62"},"agent_actions":{"view_html":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY","download_json":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY.json","view_paper":"https://pith.science/paper/YDJZXX62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04533&json=true","fetch_graph":"https://pith.science/api/pith-number/YDJZXX62JXSPTRSZAXWKVFIWDY/graph.json","fetch_events":"https://pith.science/api/pith-number/YDJZXX62JXSPTRSZAXWKVFIWDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY/action/storage_attestation","attest_author":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY/action/author_attestation","sign_citation":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY/action/citation_signature","submit_replication":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY/action/replication_record"}},"created_at":"2026-05-18T00:22:58.364739+00:00","updated_at":"2026-05-18T00:22:58.364739+00:00"}