{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:35UKH2XZHB52FC4B4UTPYWCN76","short_pith_number":"pith:35UKH2XZ","canonical_record":{"source":{"id":"1301.5055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T01:48:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"215a5f2d0a3651d8e31ea88a712f8d758e1fad43fd08e959aae727e42048dbf8","abstract_canon_sha256":"b5f8147260b739b867f0e2d43fb8857876bd86f013467616c3aaeb9367fd3e65"},"schema_version":"1.0"},"canonical_sha256":"df68a3eaf9387ba28b81e526fc584dffa92fae1e59526af3df9a394d699c8936","source":{"kind":"arxiv","id":"1301.5055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5055","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5055v1","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5055","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"35UKH2XZHB52","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"35UKH2XZHB52FC4B","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"35UKH2XZ","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:35UKH2XZHB52FC4B4UTPYWCN76","target":"record","payload":{"canonical_record":{"source":{"id":"1301.5055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T01:48:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"215a5f2d0a3651d8e31ea88a712f8d758e1fad43fd08e959aae727e42048dbf8","abstract_canon_sha256":"b5f8147260b739b867f0e2d43fb8857876bd86f013467616c3aaeb9367fd3e65"},"schema_version":"1.0"},"canonical_sha256":"df68a3eaf9387ba28b81e526fc584dffa92fae1e59526af3df9a394d699c8936","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:36.927834Z","signature_b64":"JBhCclp1MpTRCpWU+NKuSmWn2MuENxyoZT+7XKUcka5JShqfdYdnbQH/9AGvTCjfddD98Zpr+GG5bMxPgL+sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df68a3eaf9387ba28b81e526fc584dffa92fae1e59526af3df9a394d699c8936","last_reissued_at":"2026-05-18T00:08:36.927276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:36.927276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.5055","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-18T00:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hv4OuUN8tCtrgIs136mU2LOZ0KA0YhYar+SxshZSQc9ob37jFKmzoYuxrv4zh9tJzzpUPNcICMPpwn/O6iz2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:43:14.840597Z"},"content_sha256":"6de56a12d77f70eb2ab570838ac574a0552fa070086338e86123a1ae0ffe17ca","schema_version":"1.0","event_id":"sha256:6de56a12d77f70eb2ab570838ac574a0552fa070086338e86123a1ae0ffe17ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:35UKH2XZHB52FC4B4UTPYWCN76","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nested Recursions, Simultaneous Parameters and Tree Superpositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Abraham Isgur, Mustazee Rahman, Stephen Tanny, Vitaly Kuznetsov","submitted_at":"2013-01-22T01:48:42Z","abstract_excerpt":"We apply a tree-based methodology to solve new, very broadly defined families of nested recursions of the general form R(n)=sum_{i=1}^k R(n-a_i-sum_{j=1}^p R(n-b_{ij})), where a_i are integers, b_{ij} are natural numbers, and k,p are natural numbers that we use to denote \"arity\" and \"order,\" respectively, and with some specified initial conditions. The key idea of the tree-based solution method is to associate such recursions with infinite labelled trees in a natural way so that the solution to the recursions solves a counting question relating to the corresponding trees. We characterize certa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5055","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-18T00:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iu0Y5Xk0zVT0Ni+oGf6TEME/r6teQ31CwL3Z4gqWmho3PvldAs7xF6iX4kCeinxxGZW0zSGHJ69JJzosTHftBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:43:14.841258Z"},"content_sha256":"af5bcfbae0f6352e513822bee560d9aee86f54073a5beaa66938ed9f9e57b310","schema_version":"1.0","event_id":"sha256:af5bcfbae0f6352e513822bee560d9aee86f54073a5beaa66938ed9f9e57b310"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35UKH2XZHB52FC4B4UTPYWCN76/bundle.json","state_url":"https://pith.science/pith/35UKH2XZHB52FC4B4UTPYWCN76/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35UKH2XZHB52FC4B4UTPYWCN76/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-30T08:43:14Z","links":{"resolver":"https://pith.science/pith/35UKH2XZHB52FC4B4UTPYWCN76","bundle":"https://pith.science/pith/35UKH2XZHB52FC4B4UTPYWCN76/bundle.json","state":"https://pith.science/pith/35UKH2XZHB52FC4B4UTPYWCN76/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35UKH2XZHB52FC4B4UTPYWCN76/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:35UKH2XZHB52FC4B4UTPYWCN76","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":"b5f8147260b739b867f0e2d43fb8857876bd86f013467616c3aaeb9367fd3e65","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T01:48:42Z","title_canon_sha256":"215a5f2d0a3651d8e31ea88a712f8d758e1fad43fd08e959aae727e42048dbf8"},"schema_version":"1.0","source":{"id":"1301.5055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5055","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5055v1","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5055","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"35UKH2XZHB52","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"35UKH2XZHB52FC4B","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"35UKH2XZ","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:af5bcfbae0f6352e513822bee560d9aee86f54073a5beaa66938ed9f9e57b310","target":"graph","created_at":"2026-05-18T00:08: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 apply a tree-based methodology to solve new, very broadly defined families of nested recursions of the general form R(n)=sum_{i=1}^k R(n-a_i-sum_{j=1}^p R(n-b_{ij})), where a_i are integers, b_{ij} are natural numbers, and k,p are natural numbers that we use to denote \"arity\" and \"order,\" respectively, and with some specified initial conditions. The key idea of the tree-based solution method is to associate such recursions with infinite labelled trees in a natural way so that the solution to the recursions solves a counting question relating to the corresponding trees. We characterize certa","authors_text":"Abraham Isgur, Mustazee Rahman, Stephen Tanny, Vitaly Kuznetsov","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T01:48:42Z","title":"Nested Recursions, Simultaneous Parameters and Tree Superpositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5055","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:6de56a12d77f70eb2ab570838ac574a0552fa070086338e86123a1ae0ffe17ca","target":"record","created_at":"2026-05-18T00:08: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":"b5f8147260b739b867f0e2d43fb8857876bd86f013467616c3aaeb9367fd3e65","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T01:48:42Z","title_canon_sha256":"215a5f2d0a3651d8e31ea88a712f8d758e1fad43fd08e959aae727e42048dbf8"},"schema_version":"1.0","source":{"id":"1301.5055","kind":"arxiv","version":1}},"canonical_sha256":"df68a3eaf9387ba28b81e526fc584dffa92fae1e59526af3df9a394d699c8936","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df68a3eaf9387ba28b81e526fc584dffa92fae1e59526af3df9a394d699c8936","first_computed_at":"2026-05-18T00:08:36.927276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:36.927276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JBhCclp1MpTRCpWU+NKuSmWn2MuENxyoZT+7XKUcka5JShqfdYdnbQH/9AGvTCjfddD98Zpr+GG5bMxPgL+sBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:36.927834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6de56a12d77f70eb2ab570838ac574a0552fa070086338e86123a1ae0ffe17ca","sha256:af5bcfbae0f6352e513822bee560d9aee86f54073a5beaa66938ed9f9e57b310"],"state_sha256":"0fc84990cbf7402b516aa8a4750fba0ae804447746a44c72f8495c1d701d6c3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPDk/HyMmrbQYPxaIsOHzj4pEI0L21ogal9TByGqugEw4gQOP7NCVkhmE9V1KJA8zQhIPOzpTI4T9GvRY1kYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:43:14.844648Z","bundle_sha256":"10fc39bef864bdcdc05a0e55a63e4ec2115eedb02064568a9b5c296402b9b950"}}