{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:U7DIBT7LCMI5XRXZLULMEE7N3E","short_pith_number":"pith:U7DIBT7L","schema_version":"1.0","canonical_sha256":"a7c680cfeb1311dbc6f95d16c213edd906ee994dd91875ab51279d701004d594","source":{"kind":"arxiv","id":"math/0305308","version":1},"attestation_state":"computed","paper":{"title":"Numerical Analogues of Aronson's Sequence","license":"","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NT","authors_text":"Benoit Cloitre, Matthew J. Vandermast, N. J. A. Sloane","submitted_at":"2003-05-21T21:56:26Z","abstract_excerpt":"Aronson's sequence 1, 4, 11, 16, ... is defined by the English sentence ``t is the first, fourth, eleventh, sixteenth, ... letter of this sentence.'' This paper introduces some numerical analogues, such as: a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition ``n is a member of the sequence if and only if a(n) is odd.'' This sequence can also be characterized by its ``square'', the sequence a^(2)(n) = a(a(n)), which equals 2n+3 for n >= 1. There are many generalizations of this sequence, some of which are new, while others throw new light"},"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":"math/0305308","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2003-05-21T21:56:26Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"056f6998fa5e7f0ff5f36f11700df1816ca7c963befd00df71cf5cee5304597c","abstract_canon_sha256":"c12a65d107200c28d587c351a12d7a5691b18077a2da59243c3776648250fbaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:40.046701Z","signature_b64":"6KKKAZIpyTRf+CIW24xZL1hXrfR/Kj9PhvC3UL5bRjvRePjPml+/6XY7GyWvjE7mqw08Go0t602DPR64g6mkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7c680cfeb1311dbc6f95d16c213edd906ee994dd91875ab51279d701004d594","last_reissued_at":"2026-05-18T02:42:40.045568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:40.045568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical Analogues of Aronson's Sequence","license":"","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NT","authors_text":"Benoit Cloitre, Matthew J. Vandermast, N. J. A. Sloane","submitted_at":"2003-05-21T21:56:26Z","abstract_excerpt":"Aronson's sequence 1, 4, 11, 16, ... is defined by the English sentence ``t is the first, fourth, eleventh, sixteenth, ... letter of this sentence.'' This paper introduces some numerical analogues, such as: a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition ``n is a member of the sequence if and only if a(n) is odd.'' This sequence can also be characterized by its ``square'', the sequence a^(2)(n) = a(a(n)), which equals 2n+3 for n >= 1. There are many generalizations of this sequence, some of which are new, while others throw new light"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0305308","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":"math/0305308","created_at":"2026-05-18T02:42:40.046226+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0305308v1","created_at":"2026-05-18T02:42:40.046226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0305308","created_at":"2026-05-18T02:42:40.046226+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7DIBT7LCMI5","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7DIBT7LCMI5XRXZ","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7DIBT7L","created_at":"2026-05-18T12:25:52.051335+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/U7DIBT7LCMI5XRXZLULMEE7N3E","json":"https://pith.science/pith/U7DIBT7LCMI5XRXZLULMEE7N3E.json","graph_json":"https://pith.science/api/pith-number/U7DIBT7LCMI5XRXZLULMEE7N3E/graph.json","events_json":"https://pith.science/api/pith-number/U7DIBT7LCMI5XRXZLULMEE7N3E/events.json","paper":"https://pith.science/paper/U7DIBT7L"},"agent_actions":{"view_html":"https://pith.science/pith/U7DIBT7LCMI5XRXZLULMEE7N3E","download_json":"https://pith.science/pith/U7DIBT7LCMI5XRXZLULMEE7N3E.json","view_paper":"https://pith.science/paper/U7DIBT7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0305308&json=true","fetch_graph":"https://pith.science/api/pith-number/U7DIBT7LCMI5XRXZLULMEE7N3E/graph.json","fetch_events":"https://pith.science/api/pith-number/U7DIBT7LCMI5XRXZLULMEE7N3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7DIBT7LCMI5XRXZLULMEE7N3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7DIBT7LCMI5XRXZLULMEE7N3E/action/storage_attestation","attest_author":"https://pith.science/pith/U7DIBT7LCMI5XRXZLULMEE7N3E/action/author_attestation","sign_citation":"https://pith.science/pith/U7DIBT7LCMI5XRXZLULMEE7N3E/action/citation_signature","submit_replication":"https://pith.science/pith/U7DIBT7LCMI5XRXZLULMEE7N3E/action/replication_record"}},"created_at":"2026-05-18T02:42:40.046226+00:00","updated_at":"2026-05-18T02:42:40.046226+00:00"}