{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IXD3JZWYKLMDBSZALTJYHQP46U","short_pith_number":"pith:IXD3JZWY","canonical_record":{"source":{"id":"1708.06460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:48:14Z","cross_cats_sorted":[],"title_canon_sha256":"066d722f9e6fe8d862ead80a7814073251dfae4f0b1a90458295b49ec1d8a272","abstract_canon_sha256":"96c943950a8b92f42e7fba2e6f84e906f1f7341ea0c5cb2b76078d87f40b40b3"},"schema_version":"1.0"},"canonical_sha256":"45c7b4e6d852d830cb205cd383c1fcf52ed2cb0b627e711edba21e3ca01e2b97","source":{"kind":"arxiv","id":"1708.06460","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06460","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06460v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06460","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"IXD3JZWYKLMD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IXD3JZWYKLMDBSZA","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IXD3JZWY","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IXD3JZWYKLMDBSZALTJYHQP46U","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:48:14Z","cross_cats_sorted":[],"title_canon_sha256":"066d722f9e6fe8d862ead80a7814073251dfae4f0b1a90458295b49ec1d8a272","abstract_canon_sha256":"96c943950a8b92f42e7fba2e6f84e906f1f7341ea0c5cb2b76078d87f40b40b3"},"schema_version":"1.0"},"canonical_sha256":"45c7b4e6d852d830cb205cd383c1fcf52ed2cb0b627e711edba21e3ca01e2b97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:41.451967Z","signature_b64":"TfRaTSPwW/ee3sX1L8nUjP604DNVEfnjiqKW6lIj9GqurRud4dQM2nngtDLKHgfOrNyNFpW5FmpXwhAy1SSuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45c7b4e6d852d830cb205cd383c1fcf52ed2cb0b627e711edba21e3ca01e2b97","last_reissued_at":"2026-05-18T00:37:41.451299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:41.451299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06460","source_version":1,"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:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3aMHMg/jQLfGMV1/vXRaekHWrO9eHI3jWt7a8kwRv110mnu5AKsRdUF0QU8a1Xfja8bZzBElSPvHlkNLPXbODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:51:48.846276Z"},"content_sha256":"72a3275e3ffb1430aef3feb796ef54de00bf89d59a6969af41e6428c426b2fce","schema_version":"1.0","event_id":"sha256:72a3275e3ffb1430aef3feb796ef54de00bf89d59a6969af41e6428c426b2fce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IXD3JZWYKLMDBSZALTJYHQP46U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Descriptional Complexity of Operations on Semilinear Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Markus Holzer (Institut f\\\"ur Informatik, Martin Kutrib (Institut f\\\"ur Informatik, Simon Beier (Institut f\\\"ur Informatik, Universit\\\"at Giessen)","submitted_at":"2017-08-22T00:48:14Z","abstract_excerpt":"We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear set are: (i) the maximal value that appears in the vectors of periods and constants and (ii) the number of such sets of periods and constants necessary to describe the semilinear set under consideration. More precisely, we prove upper bounds on the union, intersection, complementation, and inverse homomorphism. In particular, our result on the complementatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06460","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"},"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:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2drUX6amb1U4jamlO4WBO/E3s6WYhP1LSMR5Nmm8uMgPfyKyokE/xU0XpKwIRGlLKoTrHCgPKQoX1QwOUMhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:51:48.846637Z"},"content_sha256":"962ed75cd47a8ea49d96453f0229e936bbfbfd3010647ceae24b76d0df9818cf","schema_version":"1.0","event_id":"sha256:962ed75cd47a8ea49d96453f0229e936bbfbfd3010647ceae24b76d0df9818cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXD3JZWYKLMDBSZALTJYHQP46U/bundle.json","state_url":"https://pith.science/pith/IXD3JZWYKLMDBSZALTJYHQP46U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXD3JZWYKLMDBSZALTJYHQP46U/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-07-02T09:51:48Z","links":{"resolver":"https://pith.science/pith/IXD3JZWYKLMDBSZALTJYHQP46U","bundle":"https://pith.science/pith/IXD3JZWYKLMDBSZALTJYHQP46U/bundle.json","state":"https://pith.science/pith/IXD3JZWYKLMDBSZALTJYHQP46U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXD3JZWYKLMDBSZALTJYHQP46U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IXD3JZWYKLMDBSZALTJYHQP46U","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":"96c943950a8b92f42e7fba2e6f84e906f1f7341ea0c5cb2b76078d87f40b40b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:48:14Z","title_canon_sha256":"066d722f9e6fe8d862ead80a7814073251dfae4f0b1a90458295b49ec1d8a272"},"schema_version":"1.0","source":{"id":"1708.06460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06460","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06460v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06460","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"IXD3JZWYKLMD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IXD3JZWYKLMDBSZA","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IXD3JZWY","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:962ed75cd47a8ea49d96453f0229e936bbfbfd3010647ceae24b76d0df9818cf","target":"graph","created_at":"2026-05-18T00:37:41Z","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":"We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear set are: (i) the maximal value that appears in the vectors of periods and constants and (ii) the number of such sets of periods and constants necessary to describe the semilinear set under consideration. More precisely, we prove upper bounds on the union, intersection, complementation, and inverse homomorphism. In particular, our result on the complementatio","authors_text":"Markus Holzer (Institut f\\\"ur Informatik, Martin Kutrib (Institut f\\\"ur Informatik, Simon Beier (Institut f\\\"ur Informatik, Universit\\\"at Giessen)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:48:14Z","title":"On the Descriptional Complexity of Operations on Semilinear Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06460","kind":"arxiv","version":1},"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:72a3275e3ffb1430aef3feb796ef54de00bf89d59a6969af41e6428c426b2fce","target":"record","created_at":"2026-05-18T00:37:41Z","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":"96c943950a8b92f42e7fba2e6f84e906f1f7341ea0c5cb2b76078d87f40b40b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:48:14Z","title_canon_sha256":"066d722f9e6fe8d862ead80a7814073251dfae4f0b1a90458295b49ec1d8a272"},"schema_version":"1.0","source":{"id":"1708.06460","kind":"arxiv","version":1}},"canonical_sha256":"45c7b4e6d852d830cb205cd383c1fcf52ed2cb0b627e711edba21e3ca01e2b97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45c7b4e6d852d830cb205cd383c1fcf52ed2cb0b627e711edba21e3ca01e2b97","first_computed_at":"2026-05-18T00:37:41.451299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:41.451299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TfRaTSPwW/ee3sX1L8nUjP604DNVEfnjiqKW6lIj9GqurRud4dQM2nngtDLKHgfOrNyNFpW5FmpXwhAy1SSuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:41.451967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72a3275e3ffb1430aef3feb796ef54de00bf89d59a6969af41e6428c426b2fce","sha256:962ed75cd47a8ea49d96453f0229e936bbfbfd3010647ceae24b76d0df9818cf"],"state_sha256":"d0f54ea635c8eed39cafbeceb2cdce1824c89650680913c4657a7488910c7f22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyvtvIVa4lxWtX+bTpF9VzFbd7x8+aL6fdY2h77QF/o183eAZ3upCncnxg6kEgMUk0XU6uVrpmFwlIFd35kwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T09:51:48.848547Z","bundle_sha256":"f11aad950cef89589b5f583dacea84827202e75686043869cc99edf9af94226b"}}