{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KQX5LHJE6UNO6LD62QW47MWJYR","short_pith_number":"pith:KQX5LHJE","schema_version":"1.0","canonical_sha256":"542fd59d24f51aef2c7ed42dcfb2c9c44ab0bb782ad4fd59de5554e5291df464","source":{"kind":"arxiv","id":"1403.0435","version":1},"attestation_state":"computed","paper":{"title":"Recurrence formulas with gaps for Bernoulli and Euler polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Zhi-Hong Sun","submitted_at":"2014-03-03T14:02:35Z","abstract_excerpt":"Let $\\{B_n\\}$, $\\{B_n(x)\\}$ and $\\{E_n(x)\\}$ be the Bernoulli numbers, Bernoulli polynomials and Euler polynomials, respectively. In this paper we mainly establish formulas for $\\sum_{6\\mid k-3}\\binom nkB_{n-k}(x)$, $\\sum_{6\\mid k}\\binom nkE_{n-k}(x)$ and $\\sum_{6\\mid k-3}\\binom nkm^kB_{n-k}$ in the cases $m=2,3,4$."},"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":"1403.0435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-03-03T14:02:35Z","cross_cats_sorted":[],"title_canon_sha256":"a8cabca495d42e7193c1e811ef0a41fda0b55d7eba732a469bdfdedef909dadc","abstract_canon_sha256":"74c8544cf8c8c2c2bfa98ecc101250f579138e3d08b3018055d299e9429f99af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:24.889884Z","signature_b64":"LIb2ln4iWZd29TbUsH+BL1QUXgfQL9LNUtFMerFA0jv2fbiFa/cyaLB+6bTE9EtP9U64xKvBX+RUoeQHdKt4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"542fd59d24f51aef2c7ed42dcfb2c9c44ab0bb782ad4fd59de5554e5291df464","last_reissued_at":"2026-05-18T02:57:24.889251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:24.889251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recurrence formulas with gaps for Bernoulli and Euler polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Zhi-Hong Sun","submitted_at":"2014-03-03T14:02:35Z","abstract_excerpt":"Let $\\{B_n\\}$, $\\{B_n(x)\\}$ and $\\{E_n(x)\\}$ be the Bernoulli numbers, Bernoulli polynomials and Euler polynomials, respectively. In this paper we mainly establish formulas for $\\sum_{6\\mid k-3}\\binom nkB_{n-k}(x)$, $\\sum_{6\\mid k}\\binom nkE_{n-k}(x)$ and $\\sum_{6\\mid k-3}\\binom nkm^kB_{n-k}$ in the cases $m=2,3,4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0435","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":"1403.0435","created_at":"2026-05-18T02:57:24.889361+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0435v1","created_at":"2026-05-18T02:57:24.889361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0435","created_at":"2026-05-18T02:57:24.889361+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQX5LHJE6UNO","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQX5LHJE6UNO6LD6","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQX5LHJE","created_at":"2026-05-18T12:28:35.611951+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/KQX5LHJE6UNO6LD62QW47MWJYR","json":"https://pith.science/pith/KQX5LHJE6UNO6LD62QW47MWJYR.json","graph_json":"https://pith.science/api/pith-number/KQX5LHJE6UNO6LD62QW47MWJYR/graph.json","events_json":"https://pith.science/api/pith-number/KQX5LHJE6UNO6LD62QW47MWJYR/events.json","paper":"https://pith.science/paper/KQX5LHJE"},"agent_actions":{"view_html":"https://pith.science/pith/KQX5LHJE6UNO6LD62QW47MWJYR","download_json":"https://pith.science/pith/KQX5LHJE6UNO6LD62QW47MWJYR.json","view_paper":"https://pith.science/paper/KQX5LHJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0435&json=true","fetch_graph":"https://pith.science/api/pith-number/KQX5LHJE6UNO6LD62QW47MWJYR/graph.json","fetch_events":"https://pith.science/api/pith-number/KQX5LHJE6UNO6LD62QW47MWJYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQX5LHJE6UNO6LD62QW47MWJYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQX5LHJE6UNO6LD62QW47MWJYR/action/storage_attestation","attest_author":"https://pith.science/pith/KQX5LHJE6UNO6LD62QW47MWJYR/action/author_attestation","sign_citation":"https://pith.science/pith/KQX5LHJE6UNO6LD62QW47MWJYR/action/citation_signature","submit_replication":"https://pith.science/pith/KQX5LHJE6UNO6LD62QW47MWJYR/action/replication_record"}},"created_at":"2026-05-18T02:57:24.889361+00:00","updated_at":"2026-05-18T02:57:24.889361+00:00"}