{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KQTVTRQNNVSTZH5PSKKXLBVAYQ","short_pith_number":"pith:KQTVTRQN","schema_version":"1.0","canonical_sha256":"542759c60d6d653c9faf92957586a0c40aa79eb08d3791a56534be37a979cb58","source":{"kind":"arxiv","id":"1206.4555","version":4},"attestation_state":"computed","paper":{"title":"Optimal compression of hash-origin prefix trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jarek Duda","submitted_at":"2012-06-20T16:53:04Z","abstract_excerpt":"There is a common problem of operating on hash values of elements of some database. In this paper there will be analyzed informational content of such general task and how to practically approach such found lower boundaries. Minimal prefix tree which distinguish elements turns out to require asymptotically only about 2.77544 bits per element, while standard approaches use a few times more. While being certain of working inside the database, the cost of distinguishability can be reduced further to about 2.33275 bits per elements. Increasing minimal depth of nodes to reduce probability of false "},"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":"1206.4555","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-20T16:53:04Z","cross_cats_sorted":["cs.DB","cs.DS","math.CO","math.IT"],"title_canon_sha256":"75dae0d0efc2f3c1faaaf4e3e8562652e2bb992e3f242792cb4f147b165f9edb","abstract_canon_sha256":"dc6a41749375d9d9e18edd3af8674e1fef9bea691cabfa0fc67a262be686c90d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:34.978152Z","signature_b64":"+Md5OCVQsK3fmoLly9/mJlQARYt03jGty07AaD/WG4bNJQkpVYPLo5GTUz/qqd9qrhb1gHgBiG8H+Tdk+vsDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"542759c60d6d653c9faf92957586a0c40aa79eb08d3791a56534be37a979cb58","last_reissued_at":"2026-05-18T03:51:34.977495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:34.977495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal compression of hash-origin prefix trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jarek Duda","submitted_at":"2012-06-20T16:53:04Z","abstract_excerpt":"There is a common problem of operating on hash values of elements of some database. In this paper there will be analyzed informational content of such general task and how to practically approach such found lower boundaries. Minimal prefix tree which distinguish elements turns out to require asymptotically only about 2.77544 bits per element, while standard approaches use a few times more. While being certain of working inside the database, the cost of distinguishability can be reduced further to about 2.33275 bits per elements. Increasing minimal depth of nodes to reduce probability of false "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4555","kind":"arxiv","version":4},"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":"1206.4555","created_at":"2026-05-18T03:51:34.977589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.4555v4","created_at":"2026-05-18T03:51:34.977589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4555","created_at":"2026-05-18T03:51:34.977589+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQTVTRQNNVST","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQTVTRQNNVSTZH5P","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQTVTRQN","created_at":"2026-05-18T12:27:11.947152+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/KQTVTRQNNVSTZH5PSKKXLBVAYQ","json":"https://pith.science/pith/KQTVTRQNNVSTZH5PSKKXLBVAYQ.json","graph_json":"https://pith.science/api/pith-number/KQTVTRQNNVSTZH5PSKKXLBVAYQ/graph.json","events_json":"https://pith.science/api/pith-number/KQTVTRQNNVSTZH5PSKKXLBVAYQ/events.json","paper":"https://pith.science/paper/KQTVTRQN"},"agent_actions":{"view_html":"https://pith.science/pith/KQTVTRQNNVSTZH5PSKKXLBVAYQ","download_json":"https://pith.science/pith/KQTVTRQNNVSTZH5PSKKXLBVAYQ.json","view_paper":"https://pith.science/paper/KQTVTRQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.4555&json=true","fetch_graph":"https://pith.science/api/pith-number/KQTVTRQNNVSTZH5PSKKXLBVAYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/KQTVTRQNNVSTZH5PSKKXLBVAYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQTVTRQNNVSTZH5PSKKXLBVAYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQTVTRQNNVSTZH5PSKKXLBVAYQ/action/storage_attestation","attest_author":"https://pith.science/pith/KQTVTRQNNVSTZH5PSKKXLBVAYQ/action/author_attestation","sign_citation":"https://pith.science/pith/KQTVTRQNNVSTZH5PSKKXLBVAYQ/action/citation_signature","submit_replication":"https://pith.science/pith/KQTVTRQNNVSTZH5PSKKXLBVAYQ/action/replication_record"}},"created_at":"2026-05-18T03:51:34.977589+00:00","updated_at":"2026-05-18T03:51:34.977589+00:00"}