{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LLTICYJ7KVTSADM3ZZADA5AJQF","short_pith_number":"pith:LLTICYJ7","canonical_record":{"source":{"id":"2506.00093","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-30T10:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"d3ac00474d1c1eda44bf5271a4f2a7f3984c8af01294747ca87d263c6bfb29d3","abstract_canon_sha256":"0e5f7fe9e4c938958f05df153d476ea9a1974c8edbf3743e6aa5ef1ffed48a65"},"schema_version":"1.0"},"canonical_sha256":"5ae681613f5567200d9bce40307409816a3142aa588829e5f667a53c82240da7","source":{"kind":"arxiv","id":"2506.00093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00093","created_at":"2026-07-05T11:13:28Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00093v1","created_at":"2026-07-05T11:13:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00093","created_at":"2026-07-05T11:13:28Z"},{"alias_kind":"pith_short_12","alias_value":"LLTICYJ7KVTS","created_at":"2026-07-05T11:13:28Z"},{"alias_kind":"pith_short_16","alias_value":"LLTICYJ7KVTSADM3","created_at":"2026-07-05T11:13:28Z"},{"alias_kind":"pith_short_8","alias_value":"LLTICYJ7","created_at":"2026-07-05T11:13:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LLTICYJ7KVTSADM3ZZADA5AJQF","target":"record","payload":{"canonical_record":{"source":{"id":"2506.00093","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-30T10:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"d3ac00474d1c1eda44bf5271a4f2a7f3984c8af01294747ca87d263c6bfb29d3","abstract_canon_sha256":"0e5f7fe9e4c938958f05df153d476ea9a1974c8edbf3743e6aa5ef1ffed48a65"},"schema_version":"1.0"},"canonical_sha256":"5ae681613f5567200d9bce40307409816a3142aa588829e5f667a53c82240da7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:28.965523Z","signature_b64":"UXmHzoVl5IX3O8r2Ct+H/+5Shzyxgg5uJ2Qi86nbl5r76jMwvrA99qgy0puPzOZ4z70FPNwy9CEVc5H4DuaNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ae681613f5567200d9bce40307409816a3142aa588829e5f667a53c82240da7","last_reissued_at":"2026-07-05T11:13:28.965032Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:28.965032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.00093","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-07-05T11:13:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjCe1wxwcgJ/j6um1vdDlUgDi1s+PshbikclkO7lmyNxU1YX05t7cmwblidTf2SZg78/Cqr7WWLT0upofYGfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:47:43.069495Z"},"content_sha256":"b863b83949e0c522231ae144c206ed401f3a7461a11595482f6adae4986ff932","schema_version":"1.0","event_id":"sha256:b863b83949e0c522231ae144c206ed401f3a7461a11595482f6adae4986ff932"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LLTICYJ7KVTSADM3ZZADA5AJQF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a Family of Nested Recurrences and Their Arithmetical Solutions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benoit Cloitre","submitted_at":"2025-05-30T10:09:14Z","abstract_excerpt":"A family of nested recurrence relations $a(n+1) = n - a^{(m)}(n) + a^{(m+1)}(n)$, parameterized by an integer $m \\ge 1$ with initial condition $a(1)=1$, is studied. We prove that $a(n)=n-h(n)$ is the unique solution satisfying this condition, where $h(n)$ is an arithmetical sequence in which each non-negative integer $k$ appears $mk+1$ times, with $h(n)$ 1-indexed such that $h(1)=0$. An explicit floor formula for $h(n)$ (and thus for $a(n)$) is derived. The proof of the main theorem involves establishing a key identity for $h(n)$ that arises from the recurrence; this identity is then proved us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00093","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.00093/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:13:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Need+E9vfrN9eq8+ux9gtN52PMZtjypQUstiaueMFBwHKzmM87BXTJKntgOG5EN9gNwLn67OUhcfpJVUR9E9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:47:43.070000Z"},"content_sha256":"8f534644b517c7c3a84ab7584644ace3b6a49cd06e134548b702ab8f73a43d71","schema_version":"1.0","event_id":"sha256:8f534644b517c7c3a84ab7584644ace3b6a49cd06e134548b702ab8f73a43d71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLTICYJ7KVTSADM3ZZADA5AJQF/bundle.json","state_url":"https://pith.science/pith/LLTICYJ7KVTSADM3ZZADA5AJQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLTICYJ7KVTSADM3ZZADA5AJQF/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-08-08T11:47:43Z","links":{"resolver":"https://pith.science/pith/LLTICYJ7KVTSADM3ZZADA5AJQF","bundle":"https://pith.science/pith/LLTICYJ7KVTSADM3ZZADA5AJQF/bundle.json","state":"https://pith.science/pith/LLTICYJ7KVTSADM3ZZADA5AJQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLTICYJ7KVTSADM3ZZADA5AJQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LLTICYJ7KVTSADM3ZZADA5AJQF","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":"0e5f7fe9e4c938958f05df153d476ea9a1974c8edbf3743e6aa5ef1ffed48a65","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-30T10:09:14Z","title_canon_sha256":"d3ac00474d1c1eda44bf5271a4f2a7f3984c8af01294747ca87d263c6bfb29d3"},"schema_version":"1.0","source":{"id":"2506.00093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00093","created_at":"2026-07-05T11:13:28Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00093v1","created_at":"2026-07-05T11:13:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00093","created_at":"2026-07-05T11:13:28Z"},{"alias_kind":"pith_short_12","alias_value":"LLTICYJ7KVTS","created_at":"2026-07-05T11:13:28Z"},{"alias_kind":"pith_short_16","alias_value":"LLTICYJ7KVTSADM3","created_at":"2026-07-05T11:13:28Z"},{"alias_kind":"pith_short_8","alias_value":"LLTICYJ7","created_at":"2026-07-05T11:13:28Z"}],"graph_snapshots":[{"event_id":"sha256:8f534644b517c7c3a84ab7584644ace3b6a49cd06e134548b702ab8f73a43d71","target":"graph","created_at":"2026-07-05T11:13:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.00093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A family of nested recurrence relations $a(n+1) = n - a^{(m)}(n) + a^{(m+1)}(n)$, parameterized by an integer $m \\ge 1$ with initial condition $a(1)=1$, is studied. We prove that $a(n)=n-h(n)$ is the unique solution satisfying this condition, where $h(n)$ is an arithmetical sequence in which each non-negative integer $k$ appears $mk+1$ times, with $h(n)$ 1-indexed such that $h(1)=0$. An explicit floor formula for $h(n)$ (and thus for $a(n)$) is derived. The proof of the main theorem involves establishing a key identity for $h(n)$ that arises from the recurrence; this identity is then proved us","authors_text":"Benoit Cloitre","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-30T10:09:14Z","title":"On a Family of Nested Recurrences and Their Arithmetical Solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00093","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:b863b83949e0c522231ae144c206ed401f3a7461a11595482f6adae4986ff932","target":"record","created_at":"2026-07-05T11:13:28Z","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":"0e5f7fe9e4c938958f05df153d476ea9a1974c8edbf3743e6aa5ef1ffed48a65","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-30T10:09:14Z","title_canon_sha256":"d3ac00474d1c1eda44bf5271a4f2a7f3984c8af01294747ca87d263c6bfb29d3"},"schema_version":"1.0","source":{"id":"2506.00093","kind":"arxiv","version":1}},"canonical_sha256":"5ae681613f5567200d9bce40307409816a3142aa588829e5f667a53c82240da7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ae681613f5567200d9bce40307409816a3142aa588829e5f667a53c82240da7","first_computed_at":"2026-07-05T11:13:28.965032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:28.965032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UXmHzoVl5IX3O8r2Ct+H/+5Shzyxgg5uJ2Qi86nbl5r76jMwvrA99qgy0puPzOZ4z70FPNwy9CEVc5H4DuaNBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:28.965523Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.00093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b863b83949e0c522231ae144c206ed401f3a7461a11595482f6adae4986ff932","sha256:8f534644b517c7c3a84ab7584644ace3b6a49cd06e134548b702ab8f73a43d71"],"state_sha256":"a3fa74b7b4ad8d3b7d389880d59ea9dd56002f288884a95a52235d5ca77fde58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rg7rHKhfMqOqozD+oqg9T7o24T6FIjp6g+GooMjbSIHUlh83F2Ig+KU8AjdbaK/TVMYT3e5biSozzKfjMHg+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:47:43.074163Z","bundle_sha256":"ec2b047c7c39989b66aa2008202fe197fc6c94bba284c0c1b665e71a2717ec4d"}}