{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PDCMQV2B3BE6E7QSEYLU3SADD3","short_pith_number":"pith:PDCMQV2B","schema_version":"1.0","canonical_sha256":"78c4c85741d849e27e1226174dc8031ec4a3f6ac4fead1028f70dc6aa98783d9","source":{"kind":"arxiv","id":"1611.01344","version":1},"attestation_state":"computed","paper":{"title":"The Polytope-Collision Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"James Worrell, Jo\\\"el Ouaknine, Shaull Almagor","submitted_at":"2016-11-04T12:00:41Z","abstract_excerpt":"The Orbit Problem consists of determining, given a matrix $A\\in \\mathbb{R}^{d\\times d}$ and vectors $x,y\\in \\mathbb{R}^d$, whether there exists $n\\in \\mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of Kannan and Lipton in the 1980s. Subsequently, Kannan and Lipton noted that the Orbit Problem becomes considerably harder when the target $y$ is replaced with a subspace of $\\mathbb{R}^d$. Recently, it was shown that the problem is decidable for vector-space targets of dimension at most three, followed by another development showing that the problem is in PS"},"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":"1611.01344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-04T12:00:41Z","cross_cats_sorted":[],"title_canon_sha256":"87c3803779fccade0caea462d38d9be7f73c526db4f2cbc41e179fc8b9849fbe","abstract_canon_sha256":"5a28227243afd69cc3aa4b577b202add81509c0a2b61ce1f6287f09f2624051c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:11.316888Z","signature_b64":"fpPjKF9xdxCnfaGmlangHKbqXbnV2rqEVD8W3ETlFRZHR0/ow9SI2o72coRrcV10IkDR890j1Ghg+mExEeU0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78c4c85741d849e27e1226174dc8031ec4a3f6ac4fead1028f70dc6aa98783d9","last_reissued_at":"2026-05-18T01:00:11.316391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:11.316391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Polytope-Collision Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"James Worrell, Jo\\\"el Ouaknine, Shaull Almagor","submitted_at":"2016-11-04T12:00:41Z","abstract_excerpt":"The Orbit Problem consists of determining, given a matrix $A\\in \\mathbb{R}^{d\\times d}$ and vectors $x,y\\in \\mathbb{R}^d$, whether there exists $n\\in \\mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of Kannan and Lipton in the 1980s. Subsequently, Kannan and Lipton noted that the Orbit Problem becomes considerably harder when the target $y$ is replaced with a subspace of $\\mathbb{R}^d$. Recently, it was shown that the problem is decidable for vector-space targets of dimension at most three, followed by another development showing that the problem is in PS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01344","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":"1611.01344","created_at":"2026-05-18T01:00:11.316483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01344v1","created_at":"2026-05-18T01:00:11.316483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01344","created_at":"2026-05-18T01:00:11.316483+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDCMQV2B3BE6","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDCMQV2B3BE6E7QS","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDCMQV2B","created_at":"2026-05-18T12:30:39.010887+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/PDCMQV2B3BE6E7QSEYLU3SADD3","json":"https://pith.science/pith/PDCMQV2B3BE6E7QSEYLU3SADD3.json","graph_json":"https://pith.science/api/pith-number/PDCMQV2B3BE6E7QSEYLU3SADD3/graph.json","events_json":"https://pith.science/api/pith-number/PDCMQV2B3BE6E7QSEYLU3SADD3/events.json","paper":"https://pith.science/paper/PDCMQV2B"},"agent_actions":{"view_html":"https://pith.science/pith/PDCMQV2B3BE6E7QSEYLU3SADD3","download_json":"https://pith.science/pith/PDCMQV2B3BE6E7QSEYLU3SADD3.json","view_paper":"https://pith.science/paper/PDCMQV2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01344&json=true","fetch_graph":"https://pith.science/api/pith-number/PDCMQV2B3BE6E7QSEYLU3SADD3/graph.json","fetch_events":"https://pith.science/api/pith-number/PDCMQV2B3BE6E7QSEYLU3SADD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDCMQV2B3BE6E7QSEYLU3SADD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDCMQV2B3BE6E7QSEYLU3SADD3/action/storage_attestation","attest_author":"https://pith.science/pith/PDCMQV2B3BE6E7QSEYLU3SADD3/action/author_attestation","sign_citation":"https://pith.science/pith/PDCMQV2B3BE6E7QSEYLU3SADD3/action/citation_signature","submit_replication":"https://pith.science/pith/PDCMQV2B3BE6E7QSEYLU3SADD3/action/replication_record"}},"created_at":"2026-05-18T01:00:11.316483+00:00","updated_at":"2026-05-18T01:00:11.316483+00:00"}