{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:Z2JQOVJJB2JEYYABNBKYX6IUO3","short_pith_number":"pith:Z2JQOVJJ","schema_version":"1.0","canonical_sha256":"ce930755290e924c600168558bf91476fd8d2b2f6e5066b7d5d06f6845ca3280","source":{"kind":"arxiv","id":"1003.3196","version":2},"attestation_state":"computed","paper":{"title":"On perfect hashing of numbers with sparse digit representation via multiplication by a constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Maurizio Monge","submitted_at":"2010-03-16T17:31:09Z","abstract_excerpt":"Consider the set of vectors over a field having non-zero coefficients only in a fixed sparse set and multiplication defined by convolution, or the set of integers having non-zero digits (in some base $b$) in a fixed sparse set. We show the existence of an optimal (resp. almost-optimal in the latter case) `magic' multiplier constant that provides a perfect hash function which transfers the information from the given sparse coefficients into consecutive digits. Studying the convolution case we also obtain a result of non-degeneracy for Schur functions as polynomials in the elementary symmetric f"},"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":"1003.3196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-03-16T17:31:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a51dd0790b9a68c07ed144f8f3c352d7a95bb0a80fc94f2b2dae31f700e1f23d","abstract_canon_sha256":"9a106eae92e47ff371b587642471743566bab791188c55307013fc4fff2fb10d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:57.245485Z","signature_b64":"FJdSyEbsuRh/J/fI7c5u8er21b87b6O/XLq/DfQgWvbXbhkoWyYB+/wWcw1PPpoLWFlcM7bZ8kQ0MVhq8o3ZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce930755290e924c600168558bf91476fd8d2b2f6e5066b7d5d06f6845ca3280","last_reissued_at":"2026-05-18T04:10:57.244768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:57.244768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On perfect hashing of numbers with sparse digit representation via multiplication by a constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Maurizio Monge","submitted_at":"2010-03-16T17:31:09Z","abstract_excerpt":"Consider the set of vectors over a field having non-zero coefficients only in a fixed sparse set and multiplication defined by convolution, or the set of integers having non-zero digits (in some base $b$) in a fixed sparse set. We show the existence of an optimal (resp. almost-optimal in the latter case) `magic' multiplier constant that provides a perfect hash function which transfers the information from the given sparse coefficients into consecutive digits. Studying the convolution case we also obtain a result of non-degeneracy for Schur functions as polynomials in the elementary symmetric f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3196","kind":"arxiv","version":2},"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":"1003.3196","created_at":"2026-05-18T04:10:57.244889+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.3196v2","created_at":"2026-05-18T04:10:57.244889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3196","created_at":"2026-05-18T04:10:57.244889+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2JQOVJJB2JE","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2JQOVJJB2JEYYAB","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2JQOVJJ","created_at":"2026-05-18T12:26:17.028572+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/Z2JQOVJJB2JEYYABNBKYX6IUO3","json":"https://pith.science/pith/Z2JQOVJJB2JEYYABNBKYX6IUO3.json","graph_json":"https://pith.science/api/pith-number/Z2JQOVJJB2JEYYABNBKYX6IUO3/graph.json","events_json":"https://pith.science/api/pith-number/Z2JQOVJJB2JEYYABNBKYX6IUO3/events.json","paper":"https://pith.science/paper/Z2JQOVJJ"},"agent_actions":{"view_html":"https://pith.science/pith/Z2JQOVJJB2JEYYABNBKYX6IUO3","download_json":"https://pith.science/pith/Z2JQOVJJB2JEYYABNBKYX6IUO3.json","view_paper":"https://pith.science/paper/Z2JQOVJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.3196&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2JQOVJJB2JEYYABNBKYX6IUO3/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2JQOVJJB2JEYYABNBKYX6IUO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2JQOVJJB2JEYYABNBKYX6IUO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2JQOVJJB2JEYYABNBKYX6IUO3/action/storage_attestation","attest_author":"https://pith.science/pith/Z2JQOVJJB2JEYYABNBKYX6IUO3/action/author_attestation","sign_citation":"https://pith.science/pith/Z2JQOVJJB2JEYYABNBKYX6IUO3/action/citation_signature","submit_replication":"https://pith.science/pith/Z2JQOVJJB2JEYYABNBKYX6IUO3/action/replication_record"}},"created_at":"2026-05-18T04:10:57.244889+00:00","updated_at":"2026-05-18T04:10:57.244889+00:00"}