{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:M2THLDELYEONCUIRZASOMQNDKT","short_pith_number":"pith:M2THLDEL","schema_version":"1.0","canonical_sha256":"66a6758c8bc11cd15111c824e641a354ef2fc034c52899c9e570c5c26ff1f019","source":{"kind":"arxiv","id":"1903.06267","version":1},"attestation_state":"computed","paper":{"title":"Keyed hash function from large girth expander graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.CO","authors_text":"Eustrat Zhupa, Monika K. Polak","submitted_at":"2019-03-14T21:25:10Z","abstract_excerpt":"In this paper we present an algorithm to compute keyed hash function (message authentication code MAC). Our approach uses a family of expander graphs of large girth denoted $D(n,q)$, where $n$ is a natural number bigger than one and $q$ is a prime power. Expander graphs are known to have excellent expansion properties and thus they also have very good mixing properties. All requirements for a good MAC are satisfied in our method and a discussion about collisions and preimage resistance is also part of this work. The outputs closely approximate the uniform distribution and the results we get ar"},"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":"1903.06267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-14T21:25:10Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"e14b34089aa8eb78e38e17fdbca9fd5682344876b74a5945bfe2e518b0c6ec39","abstract_canon_sha256":"486dd44b09df4be790644002afc3ec176b4995bd7e913cb09f05b6424bd320c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:11.295431Z","signature_b64":"kg3e2Y+1u40OzG+yHQJhcoLB92RfwsLfg9EQVYga1gNmu1KBr/mO+8pEUiQX6NVCjkrsLXxWjEd/M+rNyFIQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66a6758c8bc11cd15111c824e641a354ef2fc034c52899c9e570c5c26ff1f019","last_reissued_at":"2026-05-17T23:51:11.294788Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:11.294788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Keyed hash function from large girth expander graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.CO","authors_text":"Eustrat Zhupa, Monika K. Polak","submitted_at":"2019-03-14T21:25:10Z","abstract_excerpt":"In this paper we present an algorithm to compute keyed hash function (message authentication code MAC). Our approach uses a family of expander graphs of large girth denoted $D(n,q)$, where $n$ is a natural number bigger than one and $q$ is a prime power. Expander graphs are known to have excellent expansion properties and thus they also have very good mixing properties. All requirements for a good MAC are satisfied in our method and a discussion about collisions and preimage resistance is also part of this work. The outputs closely approximate the uniform distribution and the results we get ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06267","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":"1903.06267","created_at":"2026-05-17T23:51:11.294880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.06267v1","created_at":"2026-05-17T23:51:11.294880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06267","created_at":"2026-05-17T23:51:11.294880+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2THLDELYEON","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2THLDELYEONCUIR","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2THLDEL","created_at":"2026-05-18T12:33:21.387695+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/M2THLDELYEONCUIRZASOMQNDKT","json":"https://pith.science/pith/M2THLDELYEONCUIRZASOMQNDKT.json","graph_json":"https://pith.science/api/pith-number/M2THLDELYEONCUIRZASOMQNDKT/graph.json","events_json":"https://pith.science/api/pith-number/M2THLDELYEONCUIRZASOMQNDKT/events.json","paper":"https://pith.science/paper/M2THLDEL"},"agent_actions":{"view_html":"https://pith.science/pith/M2THLDELYEONCUIRZASOMQNDKT","download_json":"https://pith.science/pith/M2THLDELYEONCUIRZASOMQNDKT.json","view_paper":"https://pith.science/paper/M2THLDEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.06267&json=true","fetch_graph":"https://pith.science/api/pith-number/M2THLDELYEONCUIRZASOMQNDKT/graph.json","fetch_events":"https://pith.science/api/pith-number/M2THLDELYEONCUIRZASOMQNDKT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2THLDELYEONCUIRZASOMQNDKT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2THLDELYEONCUIRZASOMQNDKT/action/storage_attestation","attest_author":"https://pith.science/pith/M2THLDELYEONCUIRZASOMQNDKT/action/author_attestation","sign_citation":"https://pith.science/pith/M2THLDELYEONCUIRZASOMQNDKT/action/citation_signature","submit_replication":"https://pith.science/pith/M2THLDELYEONCUIRZASOMQNDKT/action/replication_record"}},"created_at":"2026-05-17T23:51:11.294880+00:00","updated_at":"2026-05-17T23:51:11.294880+00:00"}