{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VE62VM2DII7AECSPEN2NAFNICG","short_pith_number":"pith:VE62VM2D","schema_version":"1.0","canonical_sha256":"a93daab343423e020a4f2374d015a811abe144815c633ff1a76eb9d7ecf34793","source":{"kind":"arxiv","id":"1110.5285","version":1},"attestation_state":"computed","paper":{"title":"Greedy Sums and Dirichlet Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Evgeny Shchepin","submitted_at":"2011-10-24T17:22:21Z","abstract_excerpt":"We prove that the greedy sum of a direct product of two numeric arrays of complex numbers is equal to the product of the greedy sums of the factors provided that all the mentioned sums exist."},"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":"1110.5285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2011-10-24T17:22:21Z","cross_cats_sorted":[],"title_canon_sha256":"92010e1af31337e336935593ff1f639e392659612de725ddf4cff85f41b0b420","abstract_canon_sha256":"f842e583797b327dfe3cd3d19b7955530f126ed41ed584641a3f0be90ec35458"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:24.231661Z","signature_b64":"Ek0zY9+IQiDjnu+8/SENcalQ9LbXfKnb7Be2a+cmY+xdTlrojcAD5P+8fS+lZb1nROJTYURUC/hMvZyhUxlsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a93daab343423e020a4f2374d015a811abe144815c633ff1a76eb9d7ecf34793","last_reissued_at":"2026-05-18T04:10:24.231060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:24.231060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Sums and Dirichlet Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Evgeny Shchepin","submitted_at":"2011-10-24T17:22:21Z","abstract_excerpt":"We prove that the greedy sum of a direct product of two numeric arrays of complex numbers is equal to the product of the greedy sums of the factors provided that all the mentioned sums exist."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5285","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":"1110.5285","created_at":"2026-05-18T04:10:24.231171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5285v1","created_at":"2026-05-18T04:10:24.231171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5285","created_at":"2026-05-18T04:10:24.231171+00:00"},{"alias_kind":"pith_short_12","alias_value":"VE62VM2DII7A","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VE62VM2DII7AECSP","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VE62VM2D","created_at":"2026-05-18T12:26:44.992195+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/VE62VM2DII7AECSPEN2NAFNICG","json":"https://pith.science/pith/VE62VM2DII7AECSPEN2NAFNICG.json","graph_json":"https://pith.science/api/pith-number/VE62VM2DII7AECSPEN2NAFNICG/graph.json","events_json":"https://pith.science/api/pith-number/VE62VM2DII7AECSPEN2NAFNICG/events.json","paper":"https://pith.science/paper/VE62VM2D"},"agent_actions":{"view_html":"https://pith.science/pith/VE62VM2DII7AECSPEN2NAFNICG","download_json":"https://pith.science/pith/VE62VM2DII7AECSPEN2NAFNICG.json","view_paper":"https://pith.science/paper/VE62VM2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5285&json=true","fetch_graph":"https://pith.science/api/pith-number/VE62VM2DII7AECSPEN2NAFNICG/graph.json","fetch_events":"https://pith.science/api/pith-number/VE62VM2DII7AECSPEN2NAFNICG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VE62VM2DII7AECSPEN2NAFNICG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VE62VM2DII7AECSPEN2NAFNICG/action/storage_attestation","attest_author":"https://pith.science/pith/VE62VM2DII7AECSPEN2NAFNICG/action/author_attestation","sign_citation":"https://pith.science/pith/VE62VM2DII7AECSPEN2NAFNICG/action/citation_signature","submit_replication":"https://pith.science/pith/VE62VM2DII7AECSPEN2NAFNICG/action/replication_record"}},"created_at":"2026-05-18T04:10:24.231171+00:00","updated_at":"2026-05-18T04:10:24.231171+00:00"}