{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IIXCDGLIPP6OM3FDQQPJGRKAEN","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":"de1ccff3f841770509ab2848a9c41cff79bba305f5071680d8aadbf9714120d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-20T12:58:22Z","title_canon_sha256":"fdd12034af1e4702dffbea7548de61ddbbdd2d88ea7a1b8e1d430dab485fe278"},"schema_version":"1.0","source":{"id":"1504.05041","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05041","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05041v3","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05041","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"IIXCDGLIPP6O","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IIXCDGLIPP6OM3FD","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IIXCDGLI","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:107070492a926e420ef610b8dd0e0afe6efb5beab4cbc2dde6c22d453940f957","target":"graph","created_at":"2026-05-18T01:01:36Z","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 study a recursively defined sequence which is constructed using the least common multiple. It has been conjectured that every term of that sequence is $1$ or a prime. In this paper we show that this claim is connected to a strong version of Linnik's Theorem, which is yet unproved. We also study a generalization on which composite numbers may appear depending on the initial term.","authors_text":"Seraf\\'in Ruiz-Cabello","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-20T12:58:22Z","title":"On the use of the least common multiple to build a prime-generating recurrence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05041","kind":"arxiv","version":3},"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:4239bba6565d8f340c6edb92a518745e241d1ac91a9cc626599c7e3697d72067","target":"record","created_at":"2026-05-18T01:01:36Z","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":"de1ccff3f841770509ab2848a9c41cff79bba305f5071680d8aadbf9714120d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-20T12:58:22Z","title_canon_sha256":"fdd12034af1e4702dffbea7548de61ddbbdd2d88ea7a1b8e1d430dab485fe278"},"schema_version":"1.0","source":{"id":"1504.05041","kind":"arxiv","version":3}},"canonical_sha256":"422e2199687bfce66ca3841e9345402372719de29360cf1694704363e5bbfe79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"422e2199687bfce66ca3841e9345402372719de29360cf1694704363e5bbfe79","first_computed_at":"2026-05-18T01:01:36.247864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:36.247864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Kr5cdn9OoK4y4pzsAwOIj3SJXUrTAtg6CPIWt8y8k9NYiyyCipMsJeUhgWqc8XapXDIQoYI3IrkYnQEVXf0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:36.248447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05041","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4239bba6565d8f340c6edb92a518745e241d1ac91a9cc626599c7e3697d72067","sha256:107070492a926e420ef610b8dd0e0afe6efb5beab4cbc2dde6c22d453940f957"],"state_sha256":"5bb8537e986999fc2c26b25befeb03a26b98f9e62c3b2c04d9d8d73f495025f5"}