{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3CCFPQWY4CRU56PNS7STFQ5Q3J","short_pith_number":"pith:3CCFPQWY","schema_version":"1.0","canonical_sha256":"d88457c2d8e0a34ef9ed97e532c3b0da41c63106863dcd5c3c8b6dccad3afd33","source":{"kind":"arxiv","id":"1703.04938","version":1},"attestation_state":"computed","paper":{"title":"Power sums in hyperbolic Pascal triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"L\\'aszl\\'o N\\'emeth, L\\'aszl\\'o Szalay","submitted_at":"2017-03-15T05:39:46Z","abstract_excerpt":"In this paper, we describe a method to determine the power sum of the elements of the rows in the hyperbolic Pascal triangles corresponding to $\\{4,q\\}$ with $q\\ge5$. The method is based on the theory of linear recurrences, and the results are demonstrated by evaluating the $k^{th}$ power sum in the range $2\\le k\\le 11$."},"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":"1703.04938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-15T05:39:46Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"9842801da52b749b32aa070362cd4862c7e27c1388d6a31bb65d84554c0f8931","abstract_canon_sha256":"372f09d661b782b119a73860954eed70cc31785c6459d3d421e68f0be6836267"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:38.826928Z","signature_b64":"j2y9qSfmZBsVKz7JEjkCnA4LxmMS8Lfo++NfFbXaxb1sabIRcG3PueJ/cjTzSjtN+LhlaQZKAUsmu1uXpVi5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d88457c2d8e0a34ef9ed97e532c3b0da41c63106863dcd5c3c8b6dccad3afd33","last_reissued_at":"2026-05-18T00:48:38.826520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:38.826520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Power sums in hyperbolic Pascal triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"L\\'aszl\\'o N\\'emeth, L\\'aszl\\'o Szalay","submitted_at":"2017-03-15T05:39:46Z","abstract_excerpt":"In this paper, we describe a method to determine the power sum of the elements of the rows in the hyperbolic Pascal triangles corresponding to $\\{4,q\\}$ with $q\\ge5$. The method is based on the theory of linear recurrences, and the results are demonstrated by evaluating the $k^{th}$ power sum in the range $2\\le k\\le 11$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04938","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":"1703.04938","created_at":"2026-05-18T00:48:38.826582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04938v1","created_at":"2026-05-18T00:48:38.826582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04938","created_at":"2026-05-18T00:48:38.826582+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CCFPQWY4CRU","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CCFPQWY4CRU56PN","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CCFPQWY","created_at":"2026-05-18T12:30:58.224056+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/3CCFPQWY4CRU56PNS7STFQ5Q3J","json":"https://pith.science/pith/3CCFPQWY4CRU56PNS7STFQ5Q3J.json","graph_json":"https://pith.science/api/pith-number/3CCFPQWY4CRU56PNS7STFQ5Q3J/graph.json","events_json":"https://pith.science/api/pith-number/3CCFPQWY4CRU56PNS7STFQ5Q3J/events.json","paper":"https://pith.science/paper/3CCFPQWY"},"agent_actions":{"view_html":"https://pith.science/pith/3CCFPQWY4CRU56PNS7STFQ5Q3J","download_json":"https://pith.science/pith/3CCFPQWY4CRU56PNS7STFQ5Q3J.json","view_paper":"https://pith.science/paper/3CCFPQWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04938&json=true","fetch_graph":"https://pith.science/api/pith-number/3CCFPQWY4CRU56PNS7STFQ5Q3J/graph.json","fetch_events":"https://pith.science/api/pith-number/3CCFPQWY4CRU56PNS7STFQ5Q3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CCFPQWY4CRU56PNS7STFQ5Q3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CCFPQWY4CRU56PNS7STFQ5Q3J/action/storage_attestation","attest_author":"https://pith.science/pith/3CCFPQWY4CRU56PNS7STFQ5Q3J/action/author_attestation","sign_citation":"https://pith.science/pith/3CCFPQWY4CRU56PNS7STFQ5Q3J/action/citation_signature","submit_replication":"https://pith.science/pith/3CCFPQWY4CRU56PNS7STFQ5Q3J/action/replication_record"}},"created_at":"2026-05-18T00:48:38.826582+00:00","updated_at":"2026-05-18T00:48:38.826582+00:00"}