{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K7LTLCXXEO6EJV6QVO5RKPI2GS","short_pith_number":"pith:K7LTLCXX","canonical_record":{"source":{"id":"1609.00214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-01T12:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"3e3184a7caec4aafc0502a093fd171d30a9abea44ff597c722c70b9e06151cb5","abstract_canon_sha256":"c4531f8f9e048c0bdb1feba7371e407f88e21de5000c22b7c0d62da9f89929f1"},"schema_version":"1.0"},"canonical_sha256":"57d7358af723bc44d7d0abbb153d1a34a95d2c63455ac893c285b0c69663aaa4","source":{"kind":"arxiv","id":"1609.00214","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00214","created_at":"2026-05-18T01:06:26Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00214v1","created_at":"2026-05-18T01:06:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00214","created_at":"2026-05-18T01:06:26Z"},{"alias_kind":"pith_short_12","alias_value":"K7LTLCXXEO6E","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K7LTLCXXEO6EJV6Q","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K7LTLCXX","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K7LTLCXXEO6EJV6QVO5RKPI2GS","target":"record","payload":{"canonical_record":{"source":{"id":"1609.00214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-01T12:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"3e3184a7caec4aafc0502a093fd171d30a9abea44ff597c722c70b9e06151cb5","abstract_canon_sha256":"c4531f8f9e048c0bdb1feba7371e407f88e21de5000c22b7c0d62da9f89929f1"},"schema_version":"1.0"},"canonical_sha256":"57d7358af723bc44d7d0abbb153d1a34a95d2c63455ac893c285b0c69663aaa4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:26.628240Z","signature_b64":"sJ2oEeq5gUvRa9E9plrlSteN4x04dbnEl3U3ApU7oaduDhiNXjwTJ5PF5llUYGtW2+hR81rw/uPwl4L3JMynBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57d7358af723bc44d7d0abbb153d1a34a95d2c63455ac893c285b0c69663aaa4","last_reissued_at":"2026-05-18T01:06:26.627848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:26.627848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.00214","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-18T01:06:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKOkdKXfytQA5bhHSlUaAyJQT+KEL4sZbaBgkElw5/Lq5ybx9TC1rEs+ufU/OzkxFvdLbmwd7txvGqGhGrDKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:16:00.268732Z"},"content_sha256":"4f21fcbaac1e25727615b0d6356d5d3b9b719e808fa178de906ef9cd74799c36","schema_version":"1.0","event_id":"sha256:4f21fcbaac1e25727615b0d6356d5d3b9b719e808fa178de906ef9cd74799c36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K7LTLCXXEO6EJV6QVO5RKPI2GS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Separability of Reachability Sets of Vector Addition Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Charles Paperman, Lorenzo Clemente, S{\\l}awomir Lasota, Wojciech Czerwi\\'nski","submitted_at":"2016-09-01T12:42:18Z","abstract_excerpt":"Given two families of sets $\\mathcal{F}$ and $\\mathcal{G}$, the $\\mathcal{F}$ separability problem for $\\mathcal{G}$ asks whether for two given sets $U, V \\in \\mathcal{G}$ there exists a set $S \\in \\mathcal{F}$, such that $U$ is included in $S$ and $V$ is disjoint with $S$. We consider two families of sets $\\mathcal{F}$: modular sets $S \\subseteq \\mathbb{N}^d$, defined as unions of equivalence classes modulo some natural number $n \\in \\mathbb{N}$, and unary sets. Our main result is decidability of modular and unary separability for the class $\\mathcal{G}$ of reachability sets of Vector Additio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00214","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-18T01:06:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVYMwbHedFXd1qp1M37QJ7amHfgJwH9rxm8oYh3jVhLEMj1ki9mChzduwQnXAn2s+AvC72bJdHfnKos6eQtKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:16:00.269343Z"},"content_sha256":"e27f3d14b8870d998385656779b9dbb53091195305c1c9424cbfd8919d41dfb1","schema_version":"1.0","event_id":"sha256:e27f3d14b8870d998385656779b9dbb53091195305c1c9424cbfd8919d41dfb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS/bundle.json","state_url":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS/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-28T06:16:00Z","links":{"resolver":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS","bundle":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS/bundle.json","state":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K7LTLCXXEO6EJV6QVO5RKPI2GS","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":"c4531f8f9e048c0bdb1feba7371e407f88e21de5000c22b7c0d62da9f89929f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-01T12:42:18Z","title_canon_sha256":"3e3184a7caec4aafc0502a093fd171d30a9abea44ff597c722c70b9e06151cb5"},"schema_version":"1.0","source":{"id":"1609.00214","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00214","created_at":"2026-05-18T01:06:26Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00214v1","created_at":"2026-05-18T01:06:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00214","created_at":"2026-05-18T01:06:26Z"},{"alias_kind":"pith_short_12","alias_value":"K7LTLCXXEO6E","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K7LTLCXXEO6EJV6Q","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K7LTLCXX","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:e27f3d14b8870d998385656779b9dbb53091195305c1c9424cbfd8919d41dfb1","target":"graph","created_at":"2026-05-18T01:06:26Z","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":"Given two families of sets $\\mathcal{F}$ and $\\mathcal{G}$, the $\\mathcal{F}$ separability problem for $\\mathcal{G}$ asks whether for two given sets $U, V \\in \\mathcal{G}$ there exists a set $S \\in \\mathcal{F}$, such that $U$ is included in $S$ and $V$ is disjoint with $S$. We consider two families of sets $\\mathcal{F}$: modular sets $S \\subseteq \\mathbb{N}^d$, defined as unions of equivalence classes modulo some natural number $n \\in \\mathbb{N}$, and unary sets. Our main result is decidability of modular and unary separability for the class $\\mathcal{G}$ of reachability sets of Vector Additio","authors_text":"Charles Paperman, Lorenzo Clemente, S{\\l}awomir Lasota, Wojciech Czerwi\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-01T12:42:18Z","title":"Separability of Reachability Sets of Vector Addition Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00214","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:4f21fcbaac1e25727615b0d6356d5d3b9b719e808fa178de906ef9cd74799c36","target":"record","created_at":"2026-05-18T01:06:26Z","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":"c4531f8f9e048c0bdb1feba7371e407f88e21de5000c22b7c0d62da9f89929f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-01T12:42:18Z","title_canon_sha256":"3e3184a7caec4aafc0502a093fd171d30a9abea44ff597c722c70b9e06151cb5"},"schema_version":"1.0","source":{"id":"1609.00214","kind":"arxiv","version":1}},"canonical_sha256":"57d7358af723bc44d7d0abbb153d1a34a95d2c63455ac893c285b0c69663aaa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57d7358af723bc44d7d0abbb153d1a34a95d2c63455ac893c285b0c69663aaa4","first_computed_at":"2026-05-18T01:06:26.627848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:26.627848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sJ2oEeq5gUvRa9E9plrlSteN4x04dbnEl3U3ApU7oaduDhiNXjwTJ5PF5llUYGtW2+hR81rw/uPwl4L3JMynBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:26.628240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00214","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f21fcbaac1e25727615b0d6356d5d3b9b719e808fa178de906ef9cd74799c36","sha256:e27f3d14b8870d998385656779b9dbb53091195305c1c9424cbfd8919d41dfb1"],"state_sha256":"16fce25a49f4c1d138b20ddf1ab9dafe82dc8bb58a91a331c596fe03627a0910"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMGmmlZU0O0+osQ0FM3WMwoo20NxE3HB2yzFPDrtSkKeKbTV8uB9BkBzD+VfcVwfcWeJzv6OV9ZC8eZZiA5WCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:16:00.272304Z","bundle_sha256":"a9ac3f40c991c01135c7a9ee9f3c96ae51763632036373ceda904c5d4a9193c0"}}