{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YDJZXX62JXSPTRSZAXWKVFIWDY","short_pith_number":"pith:YDJZXX62","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"},"canonical_sha256":"c0d39bdfda4de4f9c65905ecaa95161e3a89928e7544db2faece1355a05c210b","source":{"kind":"arxiv","id":"1710.04533","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04533","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04533v2","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04533","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"YDJZXX62JXSP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YDJZXX62JXSPTRSZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YDJZXX62","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YDJZXX62JXSPTRSZAXWKVFIWDY","target":"record","payload":{"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"},"canonical_sha256":"c0d39bdfda4de4f9c65905ecaa95161e3a89928e7544db2faece1355a05c210b","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"},"source_kind":"arxiv","source_id":"1710.04533","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:22:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mfaSQV6Sv34vX+tZIGtfHGPIjg47nM1++1obsTnqgaPCOK8WXv0eh81vXBYZ7Y5ZxXDwAROHHgaHBGNylLr5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:05:11.422057Z"},"content_sha256":"eaf20b876f174e2ab6a08f14130e6f6d741b26d2ffd6101cedd979fe5a0f01b9","schema_version":"1.0","event_id":"sha256:eaf20b876f174e2ab6a08f14130e6f6d741b26d2ffd6101cedd979fe5a0f01b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YDJZXX62JXSPTRSZAXWKVFIWDY","target":"graph","payload":{"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"},"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:22:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rrSWMVdHn6kPbJ8fauHcB9/MkIp3YH/uW/H+JvtOq38YWUQt2xOU8SDSUUwe/NI2NVn9iv1BqUxsrxVwnx6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:05:11.422421Z"},"content_sha256":"b8ee90712cc5fdab9af8b3d4a74be974e8155aeb6d630460b8286b305cc8df55","schema_version":"1.0","event_id":"sha256:b8ee90712cc5fdab9af8b3d4a74be974e8155aeb6d630460b8286b305cc8df55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY/bundle.json","state_url":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDJZXX62JXSPTRSZAXWKVFIWDY/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-06-22T02:05:11Z","links":{"resolver":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY","bundle":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY/bundle.json","state":"https://pith.science/pith/YDJZXX62JXSPTRSZAXWKVFIWDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDJZXX62JXSPTRSZAXWKVFIWDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YDJZXX62JXSPTRSZAXWKVFIWDY","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":"4210ed9db0099da123524d180d4092ececb0178d10255bbc29baf86dfcccb3a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-12T14:15:45Z","title_canon_sha256":"f95df968c14bf77663bec96638a983cc272ab436bb088c94333e4ffb0a770f3d"},"schema_version":"1.0","source":{"id":"1710.04533","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04533","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04533v2","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04533","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"YDJZXX62JXSP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YDJZXX62JXSPTRSZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YDJZXX62","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:b8ee90712cc5fdab9af8b3d4a74be974e8155aeb6d630460b8286b305cc8df55","target":"graph","created_at":"2026-05-18T00:22: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 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","authors_text":"Hans U. Simon","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-12T14:15:45Z","title":"On the Containment Problem for Linear Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04533","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:eaf20b876f174e2ab6a08f14130e6f6d741b26d2ffd6101cedd979fe5a0f01b9","target":"record","created_at":"2026-05-18T00:22: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":"4210ed9db0099da123524d180d4092ececb0178d10255bbc29baf86dfcccb3a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-12T14:15:45Z","title_canon_sha256":"f95df968c14bf77663bec96638a983cc272ab436bb088c94333e4ffb0a770f3d"},"schema_version":"1.0","source":{"id":"1710.04533","kind":"arxiv","version":2}},"canonical_sha256":"c0d39bdfda4de4f9c65905ecaa95161e3a89928e7544db2faece1355a05c210b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0d39bdfda4de4f9c65905ecaa95161e3a89928e7544db2faece1355a05c210b","first_computed_at":"2026-05-18T00:22:58.364654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:58.364654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TuS7EASrfZX6G+3U8ZZ0Y5XXUBRcEGKe6YrAJUmZLdlhrC9/4tj0Mq7PFcYqFhIijxnpp/E4fo72CPRXLqG6Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:58.365160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04533","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eaf20b876f174e2ab6a08f14130e6f6d741b26d2ffd6101cedd979fe5a0f01b9","sha256:b8ee90712cc5fdab9af8b3d4a74be974e8155aeb6d630460b8286b305cc8df55"],"state_sha256":"693bfeebb69b534306b4001f75933689c826003452428180b8177d462b2a6bec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eaYjxN2De0KiXrq6/Bi05UEavfNPJ0whfgHmCVcLlGD0YK2HdLkB5yb6fSEOGrOaSOaFm9u/FisrEbQaRNdcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T02:05:11.424378Z","bundle_sha256":"94001b88f58a010f4254eed56fab4b590f2413d0c1bc6afead8dfe93becfa2ab"}}