{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3O4MERANCLF7Z4QD7QK6D54OZT","short_pith_number":"pith:3O4MERAN","schema_version":"1.0","canonical_sha256":"dbb8c2440d12cbfcf203fc15e1f78eccd611740f249c09cf4044e3844f9ffda0","source":{"kind":"arxiv","id":"1012.4034","version":1},"attestation_state":"computed","paper":{"title":"Identities and congruences for a new sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Zhi-Hong Sun","submitted_at":"2010-12-17T23:29:49Z","abstract_excerpt":"Let $[x]$ be the greatest integer not exceeding $x$. In the paper we introduce the sequence $\\{U_n\\}$ given by $U_0=1$ and $U_n=-2\\sum_{k=1}^{[n/2]}\\binom n{2k}U_{n-2k}\\quad(n\\ge 1)$, and establish many recursive formulas and congruences involving $\\{U_n\\}$."},"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":"1012.4034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-12-17T23:29:49Z","cross_cats_sorted":[],"title_canon_sha256":"af553f3f90f93b99e229aa5f0414efef9921fbccbdd075693af526821a0fb44f","abstract_canon_sha256":"32edb06ffdfabd431cbe9e652864235fc8b6171bf4467099f718d79df9478f89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:56.432529Z","signature_b64":"EuzXJZQhp+lg9t95QDvOkTvALd7JI42tdb4ce4gadEPVIv7iHr8LZ/uBHPhjTGMomk6AZejiYRmw9MMj6FpiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbb8c2440d12cbfcf203fc15e1f78eccd611740f249c09cf4044e3844f9ffda0","last_reissued_at":"2026-05-18T04:32:56.431850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:56.431850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identities and congruences for a new sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Zhi-Hong Sun","submitted_at":"2010-12-17T23:29:49Z","abstract_excerpt":"Let $[x]$ be the greatest integer not exceeding $x$. In the paper we introduce the sequence $\\{U_n\\}$ given by $U_0=1$ and $U_n=-2\\sum_{k=1}^{[n/2]}\\binom n{2k}U_{n-2k}\\quad(n\\ge 1)$, and establish many recursive formulas and congruences involving $\\{U_n\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4034","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":"1012.4034","created_at":"2026-05-18T04:32:56.431958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.4034v1","created_at":"2026-05-18T04:32:56.431958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4034","created_at":"2026-05-18T04:32:56.431958+00:00"},{"alias_kind":"pith_short_12","alias_value":"3O4MERANCLF7","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3O4MERANCLF7Z4QD","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3O4MERAN","created_at":"2026-05-18T12:26:03.138858+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/3O4MERANCLF7Z4QD7QK6D54OZT","json":"https://pith.science/pith/3O4MERANCLF7Z4QD7QK6D54OZT.json","graph_json":"https://pith.science/api/pith-number/3O4MERANCLF7Z4QD7QK6D54OZT/graph.json","events_json":"https://pith.science/api/pith-number/3O4MERANCLF7Z4QD7QK6D54OZT/events.json","paper":"https://pith.science/paper/3O4MERAN"},"agent_actions":{"view_html":"https://pith.science/pith/3O4MERANCLF7Z4QD7QK6D54OZT","download_json":"https://pith.science/pith/3O4MERANCLF7Z4QD7QK6D54OZT.json","view_paper":"https://pith.science/paper/3O4MERAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.4034&json=true","fetch_graph":"https://pith.science/api/pith-number/3O4MERANCLF7Z4QD7QK6D54OZT/graph.json","fetch_events":"https://pith.science/api/pith-number/3O4MERANCLF7Z4QD7QK6D54OZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3O4MERANCLF7Z4QD7QK6D54OZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3O4MERANCLF7Z4QD7QK6D54OZT/action/storage_attestation","attest_author":"https://pith.science/pith/3O4MERANCLF7Z4QD7QK6D54OZT/action/author_attestation","sign_citation":"https://pith.science/pith/3O4MERANCLF7Z4QD7QK6D54OZT/action/citation_signature","submit_replication":"https://pith.science/pith/3O4MERANCLF7Z4QD7QK6D54OZT/action/replication_record"}},"created_at":"2026-05-18T04:32:56.431958+00:00","updated_at":"2026-05-18T04:32:56.431958+00:00"}