{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:K7LTLCXXEO6EJV6QVO5RKPI2GS","short_pith_number":"pith:K7LTLCXX","schema_version":"1.0","canonical_sha256":"57d7358af723bc44d7d0abbb153d1a34a95d2c63455ac893c285b0c69663aaa4","source":{"kind":"arxiv","id":"1609.00214","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.00214","created_at":"2026-05-18T01:06:26.627903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00214v1","created_at":"2026-05-18T01:06:26.627903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00214","created_at":"2026-05-18T01:06:26.627903+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7LTLCXXEO6E","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7LTLCXXEO6EJV6Q","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7LTLCXX","created_at":"2026-05-18T12:30:25.849896+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/K7LTLCXXEO6EJV6QVO5RKPI2GS","json":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS.json","graph_json":"https://pith.science/api/pith-number/K7LTLCXXEO6EJV6QVO5RKPI2GS/graph.json","events_json":"https://pith.science/api/pith-number/K7LTLCXXEO6EJV6QVO5RKPI2GS/events.json","paper":"https://pith.science/paper/K7LTLCXX"},"agent_actions":{"view_html":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS","download_json":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS.json","view_paper":"https://pith.science/paper/K7LTLCXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00214&json=true","fetch_graph":"https://pith.science/api/pith-number/K7LTLCXXEO6EJV6QVO5RKPI2GS/graph.json","fetch_events":"https://pith.science/api/pith-number/K7LTLCXXEO6EJV6QVO5RKPI2GS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS/action/storage_attestation","attest_author":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS/action/author_attestation","sign_citation":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS/action/citation_signature","submit_replication":"https://pith.science/pith/K7LTLCXXEO6EJV6QVO5RKPI2GS/action/replication_record"}},"created_at":"2026-05-18T01:06:26.627903+00:00","updated_at":"2026-05-18T01:06:26.627903+00:00"}