{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HFMQVXV72VYEM4UNDZTOACCNX4","short_pith_number":"pith:HFMQVXV7","canonical_record":{"source":{"id":"1107.3852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-19T21:16:48Z","cross_cats_sorted":[],"title_canon_sha256":"f3e0fe79c1ff4da4a53224d28df253cfba974e2d26125ceb25567833d700a8b0","abstract_canon_sha256":"fe6c4fffe805bd7bac497003a403badbe54aba514903c58995bc35552555858b"},"schema_version":"1.0"},"canonical_sha256":"39590adebfd57046728d1e66e0084dbf3da5813c0b1c5177b3320514d0ffccc5","source":{"kind":"arxiv","id":"1107.3852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3852","created_at":"2026-05-18T04:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3852v1","created_at":"2026-05-18T04:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3852","created_at":"2026-05-18T04:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"HFMQVXV72VYE","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HFMQVXV72VYEM4UN","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HFMQVXV7","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HFMQVXV72VYEM4UNDZTOACCNX4","target":"record","payload":{"canonical_record":{"source":{"id":"1107.3852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-19T21:16:48Z","cross_cats_sorted":[],"title_canon_sha256":"f3e0fe79c1ff4da4a53224d28df253cfba974e2d26125ceb25567833d700a8b0","abstract_canon_sha256":"fe6c4fffe805bd7bac497003a403badbe54aba514903c58995bc35552555858b"},"schema_version":"1.0"},"canonical_sha256":"39590adebfd57046728d1e66e0084dbf3da5813c0b1c5177b3320514d0ffccc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:14.553770Z","signature_b64":"fs2Pc6aUU5c8KcC4gr0NcmMrTSNjLgCo3sfjiH2pv6x+YjFPArielH7Xtv8UCAW0hQZn2rkwaGYzOB+pe88QAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39590adebfd57046728d1e66e0084dbf3da5813c0b1c5177b3320514d0ffccc5","last_reissued_at":"2026-05-18T04:17:14.553124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:14.553124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.3852","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-05-18T04:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eu8Y2Rn2+QY67BnBZ/i1L0BuhOXfz1XvRgw53ne6WnRP2hEcLi1YS0jL7Hp7XmJ75wlTJqiVTJeLslsKnzhzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:32:08.715425Z"},"content_sha256":"ca6145dcbc27dbfe8029349b0e0ecf436ce09d43bc8e523f2f41b797f148aeed","schema_version":"1.0","event_id":"sha256:ca6145dcbc27dbfe8029349b0e0ecf436ce09d43bc8e523f2f41b797f148aeed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HFMQVXV72VYEM4UNDZTOACCNX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sums of Ceiling Functions Solve Nested Recursions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abraham Isgur, Rafal Drabek, Stephen Tanny, Vitaly Kuznetsov","submitted_at":"2011-07-19T21:16:48Z","abstract_excerpt":"It is known that, for given integers s \\geq 0 and j > 0, the nested recursion R(n) = R(n - s - R(n - j)) + R(n - 2j - s - R(n - 3j)) has a closed form solution for which a combinatorial interpretation exists in terms of an infinite, labeled tree. For s = 0, we show that this solution sequence has a closed form as the sum of ceiling functions C(n). Further, given appropriate initial conditions, we derive necessary and sufficient conditions on the parameters s1, a1, s2 and a2 so that C(n) solves the nested recursion R(n) = R(n - s1 - R(n - a1)) + R(n- s2 - R(n - a2))."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3852","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"},"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-18T04:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L2mhSeQ8W3lnAZVBhpwIBQb24ndRpcJOt5+oDGjxnAvZj2eqOSn9yJdyAhzGy72aTKhs9t0OanBsWCXKGubIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:32:08.716081Z"},"content_sha256":"1be5c78f0356c022fc54150cd4eb7623e4035d558b2599e4024fce94ea3835e9","schema_version":"1.0","event_id":"sha256:1be5c78f0356c022fc54150cd4eb7623e4035d558b2599e4024fce94ea3835e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFMQVXV72VYEM4UNDZTOACCNX4/bundle.json","state_url":"https://pith.science/pith/HFMQVXV72VYEM4UNDZTOACCNX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFMQVXV72VYEM4UNDZTOACCNX4/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-28T18:32:08Z","links":{"resolver":"https://pith.science/pith/HFMQVXV72VYEM4UNDZTOACCNX4","bundle":"https://pith.science/pith/HFMQVXV72VYEM4UNDZTOACCNX4/bundle.json","state":"https://pith.science/pith/HFMQVXV72VYEM4UNDZTOACCNX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFMQVXV72VYEM4UNDZTOACCNX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HFMQVXV72VYEM4UNDZTOACCNX4","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":"fe6c4fffe805bd7bac497003a403badbe54aba514903c58995bc35552555858b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-19T21:16:48Z","title_canon_sha256":"f3e0fe79c1ff4da4a53224d28df253cfba974e2d26125ceb25567833d700a8b0"},"schema_version":"1.0","source":{"id":"1107.3852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3852","created_at":"2026-05-18T04:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3852v1","created_at":"2026-05-18T04:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3852","created_at":"2026-05-18T04:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"HFMQVXV72VYE","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HFMQVXV72VYEM4UN","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HFMQVXV7","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:1be5c78f0356c022fc54150cd4eb7623e4035d558b2599e4024fce94ea3835e9","target":"graph","created_at":"2026-05-18T04:17:14Z","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":"It is known that, for given integers s \\geq 0 and j > 0, the nested recursion R(n) = R(n - s - R(n - j)) + R(n - 2j - s - R(n - 3j)) has a closed form solution for which a combinatorial interpretation exists in terms of an infinite, labeled tree. For s = 0, we show that this solution sequence has a closed form as the sum of ceiling functions C(n). Further, given appropriate initial conditions, we derive necessary and sufficient conditions on the parameters s1, a1, s2 and a2 so that C(n) solves the nested recursion R(n) = R(n - s1 - R(n - a1)) + R(n- s2 - R(n - a2)).","authors_text":"Abraham Isgur, Rafal Drabek, Stephen Tanny, Vitaly Kuznetsov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-19T21:16:48Z","title":"Sums of Ceiling Functions Solve Nested Recursions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3852","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:ca6145dcbc27dbfe8029349b0e0ecf436ce09d43bc8e523f2f41b797f148aeed","target":"record","created_at":"2026-05-18T04:17:14Z","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":"fe6c4fffe805bd7bac497003a403badbe54aba514903c58995bc35552555858b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-19T21:16:48Z","title_canon_sha256":"f3e0fe79c1ff4da4a53224d28df253cfba974e2d26125ceb25567833d700a8b0"},"schema_version":"1.0","source":{"id":"1107.3852","kind":"arxiv","version":1}},"canonical_sha256":"39590adebfd57046728d1e66e0084dbf3da5813c0b1c5177b3320514d0ffccc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39590adebfd57046728d1e66e0084dbf3da5813c0b1c5177b3320514d0ffccc5","first_computed_at":"2026-05-18T04:17:14.553124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:14.553124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fs2Pc6aUU5c8KcC4gr0NcmMrTSNjLgCo3sfjiH2pv6x+YjFPArielH7Xtv8UCAW0hQZn2rkwaGYzOB+pe88QAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:14.553770Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca6145dcbc27dbfe8029349b0e0ecf436ce09d43bc8e523f2f41b797f148aeed","sha256:1be5c78f0356c022fc54150cd4eb7623e4035d558b2599e4024fce94ea3835e9"],"state_sha256":"cd75609c38e8e81dcd4bb0bd0d1eafd4d72c5ccf698fed3496e8a8a86a833b63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RaHKgTSd0Dg9nYynyUDtog/W/X8kiiSIhCnYpwsidAURRhBOC/E7POQBG37ykhqZAXU59ufcsZ+pCzguSIfiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:32:08.719522Z","bundle_sha256":"e5d7d626b33d253dc126a14f2b5b6a02fa972d7115765608934b97367419e6f6"}}