{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VVRP6BQVQOEMWZ5O6MLZ2SCFKG","short_pith_number":"pith:VVRP6BQV","schema_version":"1.0","canonical_sha256":"ad62ff06158388cb67aef3179d484551b9d0ad23613fc9a3526f4ba09799fc74","source":{"kind":"arxiv","id":"1703.02468","version":1},"attestation_state":"computed","paper":{"title":"Data-Driven Estimation Of Mutual Information Between Dependent Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ME"],"primary_cat":"cs.IT","authors_text":"Behnaam Aazhang, Don H Johnson, Rakesh Malladi","submitted_at":"2017-03-07T16:50:38Z","abstract_excerpt":"We consider the problem of estimating mutual information between dependent data, an important problem in many science and engineering applications. We propose a data-driven, non-parametric estimator of mutual information in this paper. The main novelty of our solution lies in transforming the data to frequency domain to make the problem tractable. We define a novel metric--mutual information in frequency--to detect and quantify the dependence between two random processes across frequency using Cram\\'{e}r's spectral representation. Our solution calculates mutual information as a function of fre"},"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":"1703.02468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-07T16:50:38Z","cross_cats_sorted":["math.IT","stat.ME"],"title_canon_sha256":"c79672e004ebcbe90a59b432c0b0b42862126d592ed7febda592367c0729c798","abstract_canon_sha256":"ba0d830c3f6fc385a2d3538e385c4ab2949e775ae5f7c62458c23b8ef0c215c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:19.875944Z","signature_b64":"XLM77jjPPnaCdkMXROumHQdVgERlUPcasytXjxP1dajbNCGRt5GkeDkFOP/bUQ4rNv7hTVCaY+mzWodOqcfZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad62ff06158388cb67aef3179d484551b9d0ad23613fc9a3526f4ba09799fc74","last_reissued_at":"2026-05-18T00:49:19.875549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:19.875549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Driven Estimation Of Mutual Information Between Dependent Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ME"],"primary_cat":"cs.IT","authors_text":"Behnaam Aazhang, Don H Johnson, Rakesh Malladi","submitted_at":"2017-03-07T16:50:38Z","abstract_excerpt":"We consider the problem of estimating mutual information between dependent data, an important problem in many science and engineering applications. We propose a data-driven, non-parametric estimator of mutual information in this paper. The main novelty of our solution lies in transforming the data to frequency domain to make the problem tractable. We define a novel metric--mutual information in frequency--to detect and quantify the dependence between two random processes across frequency using Cram\\'{e}r's spectral representation. Our solution calculates mutual information as a function of fre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02468","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":"1703.02468","created_at":"2026-05-18T00:49:19.875616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02468v1","created_at":"2026-05-18T00:49:19.875616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02468","created_at":"2026-05-18T00:49:19.875616+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVRP6BQVQOEM","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVRP6BQVQOEMWZ5O","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVRP6BQV","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/VVRP6BQVQOEMWZ5O6MLZ2SCFKG","json":"https://pith.science/pith/VVRP6BQVQOEMWZ5O6MLZ2SCFKG.json","graph_json":"https://pith.science/api/pith-number/VVRP6BQVQOEMWZ5O6MLZ2SCFKG/graph.json","events_json":"https://pith.science/api/pith-number/VVRP6BQVQOEMWZ5O6MLZ2SCFKG/events.json","paper":"https://pith.science/paper/VVRP6BQV"},"agent_actions":{"view_html":"https://pith.science/pith/VVRP6BQVQOEMWZ5O6MLZ2SCFKG","download_json":"https://pith.science/pith/VVRP6BQVQOEMWZ5O6MLZ2SCFKG.json","view_paper":"https://pith.science/paper/VVRP6BQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02468&json=true","fetch_graph":"https://pith.science/api/pith-number/VVRP6BQVQOEMWZ5O6MLZ2SCFKG/graph.json","fetch_events":"https://pith.science/api/pith-number/VVRP6BQVQOEMWZ5O6MLZ2SCFKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVRP6BQVQOEMWZ5O6MLZ2SCFKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVRP6BQVQOEMWZ5O6MLZ2SCFKG/action/storage_attestation","attest_author":"https://pith.science/pith/VVRP6BQVQOEMWZ5O6MLZ2SCFKG/action/author_attestation","sign_citation":"https://pith.science/pith/VVRP6BQVQOEMWZ5O6MLZ2SCFKG/action/citation_signature","submit_replication":"https://pith.science/pith/VVRP6BQVQOEMWZ5O6MLZ2SCFKG/action/replication_record"}},"created_at":"2026-05-18T00:49:19.875616+00:00","updated_at":"2026-05-18T00:49:19.875616+00:00"}