{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7WQL6TK43BD7V6KXPIBUY4HPJJ","short_pith_number":"pith:7WQL6TK4","schema_version":"1.0","canonical_sha256":"fda0bf4d5cd847faf9577a034c70ef4a6c1c3546486eb5778d53186505a42d40","source":{"kind":"arxiv","id":"1601.06502","version":1},"attestation_state":"computed","paper":{"title":"Elliptic Curve Multiset Hash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Diego Aranha, Jeremy Maitin-Shepard, Mehdi Tibouchi","submitted_at":"2016-01-25T08:03:03Z","abstract_excerpt":"A homomorphic, or incremental, multiset hash function, associates a hash value to arbitrary collections of objects (with possible repetitions) in such a way that the hash of the union of two collections is easy to compute from the hashes of the two collections themselves: it is simply their sum under a suitable group operation. In particular, hash values of large collections can be computed incrementally and/or in parallel. Homomorphic hashing is thus a very useful primitive with applications ranging from database integrity verification to streaming set/multiset comparison and network coding.\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":"1601.06502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-25T08:03:03Z","cross_cats_sorted":[],"title_canon_sha256":"4ccd6cba651b0928fff710b33196e867713280a9ebeebc5b26088215f1721de8","abstract_canon_sha256":"8de6dc3dc73dbcabe93b61b76349f7f59b57fa4073f21e9d7c4586542a9649ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:04.301648Z","signature_b64":"ePPn4pr6+MeDfwDeYAap2/J+ZH6ibM6KHsGlM4tV7abD+t6U6bjecNEiVbfhq4mqGkNmDda3P52ri1l9Y7zTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fda0bf4d5cd847faf9577a034c70ef4a6c1c3546486eb5778d53186505a42d40","last_reissued_at":"2026-05-18T01:22:04.301164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:04.301164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Elliptic Curve Multiset Hash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Diego Aranha, Jeremy Maitin-Shepard, Mehdi Tibouchi","submitted_at":"2016-01-25T08:03:03Z","abstract_excerpt":"A homomorphic, or incremental, multiset hash function, associates a hash value to arbitrary collections of objects (with possible repetitions) in such a way that the hash of the union of two collections is easy to compute from the hashes of the two collections themselves: it is simply their sum under a suitable group operation. In particular, hash values of large collections can be computed incrementally and/or in parallel. Homomorphic hashing is thus a very useful primitive with applications ranging from database integrity verification to streaming set/multiset comparison and network coding.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06502","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":"1601.06502","created_at":"2026-05-18T01:22:04.301233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06502v1","created_at":"2026-05-18T01:22:04.301233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06502","created_at":"2026-05-18T01:22:04.301233+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WQL6TK43BD7","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WQL6TK43BD7V6KX","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WQL6TK4","created_at":"2026-05-18T12:30:04.600751+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/7WQL6TK43BD7V6KXPIBUY4HPJJ","json":"https://pith.science/pith/7WQL6TK43BD7V6KXPIBUY4HPJJ.json","graph_json":"https://pith.science/api/pith-number/7WQL6TK43BD7V6KXPIBUY4HPJJ/graph.json","events_json":"https://pith.science/api/pith-number/7WQL6TK43BD7V6KXPIBUY4HPJJ/events.json","paper":"https://pith.science/paper/7WQL6TK4"},"agent_actions":{"view_html":"https://pith.science/pith/7WQL6TK43BD7V6KXPIBUY4HPJJ","download_json":"https://pith.science/pith/7WQL6TK43BD7V6KXPIBUY4HPJJ.json","view_paper":"https://pith.science/paper/7WQL6TK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06502&json=true","fetch_graph":"https://pith.science/api/pith-number/7WQL6TK43BD7V6KXPIBUY4HPJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7WQL6TK43BD7V6KXPIBUY4HPJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WQL6TK43BD7V6KXPIBUY4HPJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WQL6TK43BD7V6KXPIBUY4HPJJ/action/storage_attestation","attest_author":"https://pith.science/pith/7WQL6TK43BD7V6KXPIBUY4HPJJ/action/author_attestation","sign_citation":"https://pith.science/pith/7WQL6TK43BD7V6KXPIBUY4HPJJ/action/citation_signature","submit_replication":"https://pith.science/pith/7WQL6TK43BD7V6KXPIBUY4HPJJ/action/replication_record"}},"created_at":"2026-05-18T01:22:04.301233+00:00","updated_at":"2026-05-18T01:22:04.301233+00:00"}