{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7NICJ4M7HAVMV7OHB7RKLFHNF2","short_pith_number":"pith:7NICJ4M7","canonical_record":{"source":{"id":"1309.1914","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-07T22:29:13Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"36dceff81713d7a64de0aca8a43005d64f1aa86dc3ffba3fc7625c9c4ac4d3fa","abstract_canon_sha256":"bef7dc586b0558605cb5c1f61e64fb73305faee193a343cfb7d4c93905083868"},"schema_version":"1.0"},"canonical_sha256":"fb5024f19f382acafdc70fe2a594ed2eb93954c2d07bf18b94c7088de94114b6","source":{"kind":"arxiv","id":"1309.1914","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1914","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1914v4","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1914","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"7NICJ4M7HAVM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7NICJ4M7HAVMV7OH","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7NICJ4M7","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7NICJ4M7HAVMV7OHB7RKLFHNF2","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1914","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-07T22:29:13Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"36dceff81713d7a64de0aca8a43005d64f1aa86dc3ffba3fc7625c9c4ac4d3fa","abstract_canon_sha256":"bef7dc586b0558605cb5c1f61e64fb73305faee193a343cfb7d4c93905083868"},"schema_version":"1.0"},"canonical_sha256":"fb5024f19f382acafdc70fe2a594ed2eb93954c2d07bf18b94c7088de94114b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:56.041379Z","signature_b64":"rvUawmyYp2mHEfw9TgCxWr5/61Q710EGWZi2VC63dZk+TfwAZ6YnbLYH1JdzAhj8ZCAbxVABfmyRgEOHCK4fCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb5024f19f382acafdc70fe2a594ed2eb93954c2d07bf18b94c7088de94114b6","last_reissued_at":"2026-05-18T00:46:56.040945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:56.040945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1914","source_version":4,"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:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sLvbxMnFkUWyOztt9X5lBOAMEP81S8gV0EN1Zk8ZDrzcbhC410Y85PE4SRA9e9yrWhp9c7XSh5qASn1l0H/TAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:08:56.925144Z"},"content_sha256":"621b4887bcbfa49322b99b654af21f4b8ce2426640b39066947c28a0ed35ae84","schema_version":"1.0","event_id":"sha256:621b4887bcbfa49322b99b654af21f4b8ce2426640b39066947c28a0ed35ae84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7NICJ4M7HAVMV7OHB7RKLFHNF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"cs.CC","authors_text":"James Worrell, Joel Ouaknine","submitted_at":"2013-09-07T22:29:13Z","abstract_excerpt":"We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine approximation concerning sums of S-units, we show that for simple LRS (those whose characteristic polynomial has no repeated roots) the Ultimate Positivity Problem is decidable in polynomial space. If we restrict to simple LRS of a fixed order then we obtain a polynomial-time decision procedure. As a complexity lower bound we show that Ultimate Positivity for simple LRS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1914","kind":"arxiv","version":4},"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:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLrSq8Ym7mwWjcxeKZB0LYYdnuhQ66hAqlmwM6+m3bRIT8VngY2ZJQvnoj9urdccwrkLVFAADa+pCn8pePd/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:08:56.925504Z"},"content_sha256":"42df9df77bf426a131a5a00f178b9045ecdb62e823227048ae3449368180fb69","schema_version":"1.0","event_id":"sha256:42df9df77bf426a131a5a00f178b9045ecdb62e823227048ae3449368180fb69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NICJ4M7HAVMV7OHB7RKLFHNF2/bundle.json","state_url":"https://pith.science/pith/7NICJ4M7HAVMV7OHB7RKLFHNF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NICJ4M7HAVMV7OHB7RKLFHNF2/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:08:56Z","links":{"resolver":"https://pith.science/pith/7NICJ4M7HAVMV7OHB7RKLFHNF2","bundle":"https://pith.science/pith/7NICJ4M7HAVMV7OHB7RKLFHNF2/bundle.json","state":"https://pith.science/pith/7NICJ4M7HAVMV7OHB7RKLFHNF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NICJ4M7HAVMV7OHB7RKLFHNF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7NICJ4M7HAVMV7OHB7RKLFHNF2","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":"bef7dc586b0558605cb5c1f61e64fb73305faee193a343cfb7d4c93905083868","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-07T22:29:13Z","title_canon_sha256":"36dceff81713d7a64de0aca8a43005d64f1aa86dc3ffba3fc7625c9c4ac4d3fa"},"schema_version":"1.0","source":{"id":"1309.1914","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1914","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1914v4","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1914","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"7NICJ4M7HAVM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7NICJ4M7HAVMV7OH","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7NICJ4M7","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:42df9df77bf426a131a5a00f178b9045ecdb62e823227048ae3449368180fb69","target":"graph","created_at":"2026-05-18T00:46:56Z","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 consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine approximation concerning sums of S-units, we show that for simple LRS (those whose characteristic polynomial has no repeated roots) the Ultimate Positivity Problem is decidable in polynomial space. If we restrict to simple LRS of a fixed order then we obtain a polynomial-time decision procedure. As a complexity lower bound we show that Ultimate Positivity for simple LRS","authors_text":"James Worrell, Joel Ouaknine","cross_cats":["cs.DM","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-07T22:29:13Z","title":"Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1914","kind":"arxiv","version":4},"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:621b4887bcbfa49322b99b654af21f4b8ce2426640b39066947c28a0ed35ae84","target":"record","created_at":"2026-05-18T00:46:56Z","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":"bef7dc586b0558605cb5c1f61e64fb73305faee193a343cfb7d4c93905083868","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-07T22:29:13Z","title_canon_sha256":"36dceff81713d7a64de0aca8a43005d64f1aa86dc3ffba3fc7625c9c4ac4d3fa"},"schema_version":"1.0","source":{"id":"1309.1914","kind":"arxiv","version":4}},"canonical_sha256":"fb5024f19f382acafdc70fe2a594ed2eb93954c2d07bf18b94c7088de94114b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb5024f19f382acafdc70fe2a594ed2eb93954c2d07bf18b94c7088de94114b6","first_computed_at":"2026-05-18T00:46:56.040945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:56.040945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rvUawmyYp2mHEfw9TgCxWr5/61Q710EGWZi2VC63dZk+TfwAZ6YnbLYH1JdzAhj8ZCAbxVABfmyRgEOHCK4fCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:56.041379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1914","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:621b4887bcbfa49322b99b654af21f4b8ce2426640b39066947c28a0ed35ae84","sha256:42df9df77bf426a131a5a00f178b9045ecdb62e823227048ae3449368180fb69"],"state_sha256":"86b7eb4d099a89d2f15ea8f1e1fe6642bc2bf6f46133864d69822411ef0b2139"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdgv2nvmQQ7GZnyhCealfqA8qIMGr+Lt3vgtZuxqdTMBESSIOsLJyvzTGvWh5f2D2cdMYUyIu8ylSDVM2VLxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:08:56.927448Z","bundle_sha256":"74648dd6c5694db88e9757c37367b11659c91a46d389d69bacc853f5edcb82d7"}}