{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FMMUCGSAWVVYSBUBPZLRITJYFP","short_pith_number":"pith:FMMUCGSA","canonical_record":{"source":{"id":"1202.0276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-01T05:19:55Z","cross_cats_sorted":[],"title_canon_sha256":"3ca47bdf0f980ef2a1bc2bba53d5380e6b3c434e772e1b7a492a3172d7182b33","abstract_canon_sha256":"279ffc776732c9a7bec199d7f1660f2f391d0d527fa89adb147e05bead9b97e8"},"schema_version":"1.0"},"canonical_sha256":"2b19411a40b56b8906817e57144d382bdb91ca6e32da0721ea5190da6d3a39c8","source":{"kind":"arxiv","id":"1202.0276","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0276","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0276v1","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0276","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"FMMUCGSAWVVY","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FMMUCGSAWVVYSBUB","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FMMUCGSA","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FMMUCGSAWVVYSBUBPZLRITJYFP","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-01T05:19:55Z","cross_cats_sorted":[],"title_canon_sha256":"3ca47bdf0f980ef2a1bc2bba53d5380e6b3c434e772e1b7a492a3172d7182b33","abstract_canon_sha256":"279ffc776732c9a7bec199d7f1660f2f391d0d527fa89adb147e05bead9b97e8"},"schema_version":"1.0"},"canonical_sha256":"2b19411a40b56b8906817e57144d382bdb91ca6e32da0721ea5190da6d3a39c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:18.830096Z","signature_b64":"exMrH82Im4SPXYzczV7LdA/NZJEpCzX/2xiVyQz26skjUAFHZKhUxXBhyNJLRCgTf1j5AgwXvoQ6Y0H8TZbPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b19411a40b56b8906817e57144d382bdb91ca6e32da0721ea5190da6d3a39c8","last_reissued_at":"2026-05-18T04:03:18.829614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:18.829614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0276","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:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1gxrdYE5gNS+4h901hpGzueeBSYAn5PJRyX2kNNDFO5SwRhanBatr90tx4UMd5vGuKO1E1uatBRGS1K/jqZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:25:14.543219Z"},"content_sha256":"1e617eef02c074af7e2d089f4fff591ffbafbb1db4a4458681210454804ba7c8","schema_version":"1.0","event_id":"sha256:1e617eef02c074af7e2d089f4fff591ffbafbb1db4a4458681210454804ba7c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FMMUCGSAWVVYSBUBPZLRITJYFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A combinatorial approach for solving certain nested recursions with non-slow solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abraham Isgur, Stephen Tanny, Vitaly Kuznetsov","submitted_at":"2012-02-01T05:19:55Z","abstract_excerpt":"We define the generalized Golomb triangular recursion by g_{j,s,lambda}(n) = g_{j,s,lambda}(n - s - g_{j,s,lambda}(n-j)) + \\lambda j. For particular choices of the initial conditions, we show that the solution of the recursion is a non-slow monotone sequence for which we can provide a combinatorial interpretation in terms of a weighted count of the leaves of a certain labeled infinite tree. We discover that more than one such tree interpretation is possible, leading to different choices of the initial conditions and alternative solutions that are closely related. In the case lambda=1 the initi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0276","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:03:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JIRlIsjwh6t2TqfhzKDv9Wr4IKDSP7Y8W4Ldjw/IOP6utMajHQZCF/k7ZI1kBMj0tTPZmpIeKVmyM1Cuim0gCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:25:14.543889Z"},"content_sha256":"f16fa5ebca48abe29c9f7831a40fe95f6a1bf91cc785fccb4f9887984cdb0a39","schema_version":"1.0","event_id":"sha256:f16fa5ebca48abe29c9f7831a40fe95f6a1bf91cc785fccb4f9887984cdb0a39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FMMUCGSAWVVYSBUBPZLRITJYFP/bundle.json","state_url":"https://pith.science/pith/FMMUCGSAWVVYSBUBPZLRITJYFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FMMUCGSAWVVYSBUBPZLRITJYFP/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-28T15:25:14Z","links":{"resolver":"https://pith.science/pith/FMMUCGSAWVVYSBUBPZLRITJYFP","bundle":"https://pith.science/pith/FMMUCGSAWVVYSBUBPZLRITJYFP/bundle.json","state":"https://pith.science/pith/FMMUCGSAWVVYSBUBPZLRITJYFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FMMUCGSAWVVYSBUBPZLRITJYFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FMMUCGSAWVVYSBUBPZLRITJYFP","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":"279ffc776732c9a7bec199d7f1660f2f391d0d527fa89adb147e05bead9b97e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-01T05:19:55Z","title_canon_sha256":"3ca47bdf0f980ef2a1bc2bba53d5380e6b3c434e772e1b7a492a3172d7182b33"},"schema_version":"1.0","source":{"id":"1202.0276","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0276","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0276v1","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0276","created_at":"2026-05-18T04:03:18Z"},{"alias_kind":"pith_short_12","alias_value":"FMMUCGSAWVVY","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FMMUCGSAWVVYSBUB","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FMMUCGSA","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:f16fa5ebca48abe29c9f7831a40fe95f6a1bf91cc785fccb4f9887984cdb0a39","target":"graph","created_at":"2026-05-18T04:03:18Z","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 define the generalized Golomb triangular recursion by g_{j,s,lambda}(n) = g_{j,s,lambda}(n - s - g_{j,s,lambda}(n-j)) + \\lambda j. For particular choices of the initial conditions, we show that the solution of the recursion is a non-slow monotone sequence for which we can provide a combinatorial interpretation in terms of a weighted count of the leaves of a certain labeled infinite tree. We discover that more than one such tree interpretation is possible, leading to different choices of the initial conditions and alternative solutions that are closely related. In the case lambda=1 the initi","authors_text":"Abraham Isgur, Stephen Tanny, Vitaly Kuznetsov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-01T05:19:55Z","title":"A combinatorial approach for solving certain nested recursions with non-slow solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0276","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:1e617eef02c074af7e2d089f4fff591ffbafbb1db4a4458681210454804ba7c8","target":"record","created_at":"2026-05-18T04:03:18Z","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":"279ffc776732c9a7bec199d7f1660f2f391d0d527fa89adb147e05bead9b97e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-01T05:19:55Z","title_canon_sha256":"3ca47bdf0f980ef2a1bc2bba53d5380e6b3c434e772e1b7a492a3172d7182b33"},"schema_version":"1.0","source":{"id":"1202.0276","kind":"arxiv","version":1}},"canonical_sha256":"2b19411a40b56b8906817e57144d382bdb91ca6e32da0721ea5190da6d3a39c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b19411a40b56b8906817e57144d382bdb91ca6e32da0721ea5190da6d3a39c8","first_computed_at":"2026-05-18T04:03:18.829614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:18.829614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"exMrH82Im4SPXYzczV7LdA/NZJEpCzX/2xiVyQz26skjUAFHZKhUxXBhyNJLRCgTf1j5AgwXvoQ6Y0H8TZbPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:18.830096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0276","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e617eef02c074af7e2d089f4fff591ffbafbb1db4a4458681210454804ba7c8","sha256:f16fa5ebca48abe29c9f7831a40fe95f6a1bf91cc785fccb4f9887984cdb0a39"],"state_sha256":"d8bbb3c53bf496e991798013caf3eb5d4b56eeae50ff9268ffab885781c146e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AemimINZ0Sk2TzxIl/OQqdHjrW3UqJi1DjHQB4cH1sRgO/CTGSbhGl0amFEtaZLXcamSNOEIXANay4WqHzHlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:25:14.547115Z","bundle_sha256":"608d6e979247b6a9591a9093e810e5d787e63e5e263841ea0c45003249245c93"}}