{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VKD6ZPYEIAQU3NGHE2K6UR4PB6","short_pith_number":"pith:VKD6ZPYE","schema_version":"1.0","canonical_sha256":"aa87ecbf0440214db4c72695ea478f0f870363af112d55dc25b56c7001deb0f0","source":{"kind":"arxiv","id":"1704.05758","version":2},"attestation_state":"computed","paper":{"title":"Rate-Distortion Theory of Finite Point Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Dominic Schuhmacher, Franz Hlawatsch, G\\\"unther Koliander","submitted_at":"2017-04-19T14:52:39Z","abstract_excerpt":"We study the compression of data in the case where the useful information is contained in a set rather than a vector, i.e., the ordering of the data points is irrelevant and the number of data points is unknown. Our analysis is based on rate-distortion theory and the theory of finite point processes. We introduce fundamental information-theoretic concepts and quantities for point processes and present general lower and upper bounds on the rate-distortion function. To enable a comparison with the vector setting, we concretize our bounds for point processes of fixed cardinality. In particular, w"},"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":"1704.05758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-19T14:52:39Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"7bcae70530f44ccae6a97645f01eb3ccc5aaca39b23dfa6766dd1161038ff0c0","abstract_canon_sha256":"534724bab0a3bfd28f46e52f2221cf63293cf5f7de63f68cad33b39bb5a7a70d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:30.790706Z","signature_b64":"p24rH2WWZN+8R0QP4tah/z/7P+bhZwP82ao1vVStdMF6+qyMIt5o14MIKr0Zi9mffUVIIQxpUJQGQysKZpMnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa87ecbf0440214db4c72695ea478f0f870363af112d55dc25b56c7001deb0f0","last_reissued_at":"2026-05-18T00:15:30.790201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:30.790201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-Distortion Theory of Finite Point Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Dominic Schuhmacher, Franz Hlawatsch, G\\\"unther Koliander","submitted_at":"2017-04-19T14:52:39Z","abstract_excerpt":"We study the compression of data in the case where the useful information is contained in a set rather than a vector, i.e., the ordering of the data points is irrelevant and the number of data points is unknown. Our analysis is based on rate-distortion theory and the theory of finite point processes. We introduce fundamental information-theoretic concepts and quantities for point processes and present general lower and upper bounds on the rate-distortion function. To enable a comparison with the vector setting, we concretize our bounds for point processes of fixed cardinality. In particular, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05758","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":"1704.05758","created_at":"2026-05-18T00:15:30.790281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05758v2","created_at":"2026-05-18T00:15:30.790281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05758","created_at":"2026-05-18T00:15:30.790281+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKD6ZPYEIAQU","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKD6ZPYEIAQU3NGH","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKD6ZPYE","created_at":"2026-05-18T12:31:49.984773+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/VKD6ZPYEIAQU3NGHE2K6UR4PB6","json":"https://pith.science/pith/VKD6ZPYEIAQU3NGHE2K6UR4PB6.json","graph_json":"https://pith.science/api/pith-number/VKD6ZPYEIAQU3NGHE2K6UR4PB6/graph.json","events_json":"https://pith.science/api/pith-number/VKD6ZPYEIAQU3NGHE2K6UR4PB6/events.json","paper":"https://pith.science/paper/VKD6ZPYE"},"agent_actions":{"view_html":"https://pith.science/pith/VKD6ZPYEIAQU3NGHE2K6UR4PB6","download_json":"https://pith.science/pith/VKD6ZPYEIAQU3NGHE2K6UR4PB6.json","view_paper":"https://pith.science/paper/VKD6ZPYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05758&json=true","fetch_graph":"https://pith.science/api/pith-number/VKD6ZPYEIAQU3NGHE2K6UR4PB6/graph.json","fetch_events":"https://pith.science/api/pith-number/VKD6ZPYEIAQU3NGHE2K6UR4PB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKD6ZPYEIAQU3NGHE2K6UR4PB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKD6ZPYEIAQU3NGHE2K6UR4PB6/action/storage_attestation","attest_author":"https://pith.science/pith/VKD6ZPYEIAQU3NGHE2K6UR4PB6/action/author_attestation","sign_citation":"https://pith.science/pith/VKD6ZPYEIAQU3NGHE2K6UR4PB6/action/citation_signature","submit_replication":"https://pith.science/pith/VKD6ZPYEIAQU3NGHE2K6UR4PB6/action/replication_record"}},"created_at":"2026-05-18T00:15:30.790281+00:00","updated_at":"2026-05-18T00:15:30.790281+00:00"}