{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OEL3GR5HJNWKUOKAA4EOM4VTM2","short_pith_number":"pith:OEL3GR5H","canonical_record":{"source":{"id":"1701.02162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-09T13:00:53Z","cross_cats_sorted":["cs.LO","cs.SC","math.AG","math.NT"],"title_canon_sha256":"ca716b39a676d1b08fef67cb2a6d7cdd1cf975529cd5a4ecc6f60d1fedfbcb3d","abstract_canon_sha256":"b263ac7174eee4ee3eac4b0720f0f1645b6673b1b228545a0ad0ed70a5b98e0e"},"schema_version":"1.0"},"canonical_sha256":"7117b347a74b6caa39400708e672b366b89ccab20ebaef6f683eee06da1daf5d","source":{"kind":"arxiv","id":"1701.02162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02162","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02162v1","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02162","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"pith_short_12","alias_value":"OEL3GR5HJNWK","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OEL3GR5HJNWKUOKA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OEL3GR5H","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OEL3GR5HJNWKUOKAA4EOM4VTM2","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-09T13:00:53Z","cross_cats_sorted":["cs.LO","cs.SC","math.AG","math.NT"],"title_canon_sha256":"ca716b39a676d1b08fef67cb2a6d7cdd1cf975529cd5a4ecc6f60d1fedfbcb3d","abstract_canon_sha256":"b263ac7174eee4ee3eac4b0720f0f1645b6673b1b228545a0ad0ed70a5b98e0e"},"schema_version":"1.0"},"canonical_sha256":"7117b347a74b6caa39400708e672b366b89ccab20ebaef6f683eee06da1daf5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:11.530394Z","signature_b64":"rE5ijPFohwuYyFeaF4GQ2lTwC97h27tzMmoejVUIFXGqC4uVFed73TRYSVYY6w8CSd1PDYrvCHLbuDNUMIPrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7117b347a74b6caa39400708e672b366b89ccab20ebaef6f683eee06da1daf5d","last_reissued_at":"2026-05-18T00:53:11.529774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:11.529774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02162","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:53:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZT9hBEnxf7XqmenkoAkmWCJbe5DCLYIScCe+cSgpNaeUdVVmWFzhcVfuEKabZ+3a3Pq8EJwiQrGJeLRv9ZyVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:57:06.286769Z"},"content_sha256":"f860a08ece0bc9d9b5f97de0cea0ac5ca4ec5e48a7c9e62f498b82e84ecdb344","schema_version":"1.0","event_id":"sha256:f860a08ece0bc9d9b5f97de0cea0ac5ca4ec5e48a7c9e62f498b82e84ecdb344"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OEL3GR5HJNWKUOKAA4EOM4VTM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SC","math.AG","math.NT"],"primary_cat":"cs.CC","authors_text":"Amaury Pouly, James Worrell, Jo\\\"el Ouaknine, Nathana\\\"el Fijalkow, Pierre Ohlmann","submitted_at":"2017-01-09T13:00:53Z","abstract_excerpt":"The \\emph{Orbit Problem} consists of determining, given a linear transformation $A$ on $\\mathbb{Q}^d$, together with vectors $x$ and $y$, whether the orbit of $x$ under repeated applications of $A$ can ever reach $y$. This problem was famously shown to be decidable by Kannan and Lipton in the 1980s.\n  In this paper, we are concerned with the problem of synthesising suitable \\emph{invariants} $\\mathcal{P} \\subseteq \\mathbb{R}^d$, \\emph{i.e.}, sets that are stable under $A$ and contain $x$ and not $y$, thereby providing compact and versatile certificates of non-reachability. We show that whether"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02162","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:53:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nHPzrT13B5/4ysUXF1G6KRQoPRTj5C+Zx/GzqOlpjhS4ns2AOmhvOoYHx+PyPcrm+HfjHnmlYaFzdrFUldBrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:57:06.287187Z"},"content_sha256":"62a8280591c40aeec9ed3e1b8f45ac7bb51d83028925035e52b0fa51f4e3b6b3","schema_version":"1.0","event_id":"sha256:62a8280591c40aeec9ed3e1b8f45ac7bb51d83028925035e52b0fa51f4e3b6b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEL3GR5HJNWKUOKAA4EOM4VTM2/bundle.json","state_url":"https://pith.science/pith/OEL3GR5HJNWKUOKAA4EOM4VTM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEL3GR5HJNWKUOKAA4EOM4VTM2/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-28T12:57:06Z","links":{"resolver":"https://pith.science/pith/OEL3GR5HJNWKUOKAA4EOM4VTM2","bundle":"https://pith.science/pith/OEL3GR5HJNWKUOKAA4EOM4VTM2/bundle.json","state":"https://pith.science/pith/OEL3GR5HJNWKUOKAA4EOM4VTM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEL3GR5HJNWKUOKAA4EOM4VTM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OEL3GR5HJNWKUOKAA4EOM4VTM2","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":"b263ac7174eee4ee3eac4b0720f0f1645b6673b1b228545a0ad0ed70a5b98e0e","cross_cats_sorted":["cs.LO","cs.SC","math.AG","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-09T13:00:53Z","title_canon_sha256":"ca716b39a676d1b08fef67cb2a6d7cdd1cf975529cd5a4ecc6f60d1fedfbcb3d"},"schema_version":"1.0","source":{"id":"1701.02162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02162","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02162v1","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02162","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"pith_short_12","alias_value":"OEL3GR5HJNWK","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OEL3GR5HJNWKUOKA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OEL3GR5H","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:62a8280591c40aeec9ed3e1b8f45ac7bb51d83028925035e52b0fa51f4e3b6b3","target":"graph","created_at":"2026-05-18T00:53:11Z","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":"The \\emph{Orbit Problem} consists of determining, given a linear transformation $A$ on $\\mathbb{Q}^d$, together with vectors $x$ and $y$, whether the orbit of $x$ under repeated applications of $A$ can ever reach $y$. This problem was famously shown to be decidable by Kannan and Lipton in the 1980s.\n  In this paper, we are concerned with the problem of synthesising suitable \\emph{invariants} $\\mathcal{P} \\subseteq \\mathbb{R}^d$, \\emph{i.e.}, sets that are stable under $A$ and contain $x$ and not $y$, thereby providing compact and versatile certificates of non-reachability. We show that whether","authors_text":"Amaury Pouly, James Worrell, Jo\\\"el Ouaknine, Nathana\\\"el Fijalkow, Pierre Ohlmann","cross_cats":["cs.LO","cs.SC","math.AG","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-09T13:00:53Z","title":"Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02162","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:f860a08ece0bc9d9b5f97de0cea0ac5ca4ec5e48a7c9e62f498b82e84ecdb344","target":"record","created_at":"2026-05-18T00:53:11Z","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":"b263ac7174eee4ee3eac4b0720f0f1645b6673b1b228545a0ad0ed70a5b98e0e","cross_cats_sorted":["cs.LO","cs.SC","math.AG","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-09T13:00:53Z","title_canon_sha256":"ca716b39a676d1b08fef67cb2a6d7cdd1cf975529cd5a4ecc6f60d1fedfbcb3d"},"schema_version":"1.0","source":{"id":"1701.02162","kind":"arxiv","version":1}},"canonical_sha256":"7117b347a74b6caa39400708e672b366b89ccab20ebaef6f683eee06da1daf5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7117b347a74b6caa39400708e672b366b89ccab20ebaef6f683eee06da1daf5d","first_computed_at":"2026-05-18T00:53:11.529774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:11.529774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rE5ijPFohwuYyFeaF4GQ2lTwC97h27tzMmoejVUIFXGqC4uVFed73TRYSVYY6w8CSd1PDYrvCHLbuDNUMIPrBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:11.530394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f860a08ece0bc9d9b5f97de0cea0ac5ca4ec5e48a7c9e62f498b82e84ecdb344","sha256:62a8280591c40aeec9ed3e1b8f45ac7bb51d83028925035e52b0fa51f4e3b6b3"],"state_sha256":"646943029f814905e3383040b2e00e561203c6d1d7ee97a9e7f1e4a974da5935"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cR/BIZ+Ou3n0CGbR8FT0cxmUK8DBYfQlvKvn9Lf8LaUwAE6D3i8fjIYg16qKECmfuWerHjv8a2eT/UOhoIlCBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:57:06.289175Z","bundle_sha256":"8f085e26f9adbf513933f8f0672c92ef5c4fbf208ae33a9f06955d7057e58f5b"}}