{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:X3YAQ2HRTPVBLZGZPPU7CQAR5Q","short_pith_number":"pith:X3YAQ2HR","canonical_record":{"source":{"id":"1712.00205","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-12-01T06:19:33Z","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.ML"],"title_canon_sha256":"a1ab5c2f834f99b82728ac9c089fff074d5ab5620fa5e27b0aa749d8070e88d3","abstract_canon_sha256":"286c6f9729b2197ba11ea48769f6e9a998b176a2362e550e151b65868e7f55a0"},"schema_version":"1.0"},"canonical_sha256":"bef00868f19bea15e4d97be9f14011ec18c9b4367e3249d48c3619f233706bf3","source":{"kind":"arxiv","id":"1712.00205","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00205","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00205v2","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00205","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"X3YAQ2HRTPVB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X3YAQ2HRTPVBLZGZ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X3YAQ2HR","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:X3YAQ2HRTPVBLZGZPPU7CQAR5Q","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00205","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-12-01T06:19:33Z","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.ML"],"title_canon_sha256":"a1ab5c2f834f99b82728ac9c089fff074d5ab5620fa5e27b0aa749d8070e88d3","abstract_canon_sha256":"286c6f9729b2197ba11ea48769f6e9a998b176a2362e550e151b65868e7f55a0"},"schema_version":"1.0"},"canonical_sha256":"bef00868f19bea15e4d97be9f14011ec18c9b4367e3249d48c3619f233706bf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:19.239158Z","signature_b64":"pLGuy9Hecyx1Z1LXPu0WaBfptlGQrmuySNJrBGoY6f3gxQHz7W8/gt/iDMtErk2bVeu+WmxP/cs4W/WCRum0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bef00868f19bea15e4d97be9f14011ec18c9b4367e3249d48c3619f233706bf3","last_reissued_at":"2026-05-18T00:03:19.238672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:19.238672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00205","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9MBXkPWGlj73MyxGKKg2w08v/yezFA6IRNczqVpOoWZu1FGzgYqVWLeMYObdowqjP1Um7lUZpI9YrFHtgzYABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:58:12.140232Z"},"content_sha256":"0c1bcd1f40e998a8d1ef1f5831cf9608c85fc51c5afac2b710bf2ee8119aaa08","schema_version":"1.0","event_id":"sha256:0c1bcd1f40e998a8d1ef1f5831cf9608c85fc51c5afac2b710bf2ee8119aaa08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:X3YAQ2HRTPVBLZGZPPU7CQAR5Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tensors, Learning, and 'Kolmogorov Extension' for Finite-alphabet Random Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR","stat.ML"],"primary_cat":"eess.SP","authors_text":"Nicholas D. Sidiropoulos, Nikos Kargas, Xiao Fu","submitted_at":"2017-12-01T06:19:33Z","abstract_excerpt":"Estimating the joint probability mass function (PMF) of a set of random variables lies at the heart of statistical learning and signal processing. Without structural assumptions, such as modeling the variables as a Markov chain, tree, or other graphical model, joint PMF estimation is often considered mission impossible - the number of unknowns grows exponentially with the number of variables. But who gives us the structural model? Is there a generic, `non-parametric' way to control joint PMF complexity without relying on a priori structural assumptions regarding the underlying probability mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00205","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/tSPJxunESojtRBd94DoWyd44SPAVQjyeT8Oz0MbUTBFq/BAReyoxH+EeafOgjF7A5rPTivnmXBVJS8S1sjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:58:12.140593Z"},"content_sha256":"1fefc8a49fcd97fa1093f5d276eb4f7940a7f009b3f7013cf0d6f987ff07ad0f","schema_version":"1.0","event_id":"sha256:1fefc8a49fcd97fa1093f5d276eb4f7940a7f009b3f7013cf0d6f987ff07ad0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X3YAQ2HRTPVBLZGZPPU7CQAR5Q/bundle.json","state_url":"https://pith.science/pith/X3YAQ2HRTPVBLZGZPPU7CQAR5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X3YAQ2HRTPVBLZGZPPU7CQAR5Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T10:58:12Z","links":{"resolver":"https://pith.science/pith/X3YAQ2HRTPVBLZGZPPU7CQAR5Q","bundle":"https://pith.science/pith/X3YAQ2HRTPVBLZGZPPU7CQAR5Q/bundle.json","state":"https://pith.science/pith/X3YAQ2HRTPVBLZGZPPU7CQAR5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X3YAQ2HRTPVBLZGZPPU7CQAR5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X3YAQ2HRTPVBLZGZPPU7CQAR5Q","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"286c6f9729b2197ba11ea48769f6e9a998b176a2362e550e151b65868e7f55a0","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-12-01T06:19:33Z","title_canon_sha256":"a1ab5c2f834f99b82728ac9c089fff074d5ab5620fa5e27b0aa749d8070e88d3"},"schema_version":"1.0","source":{"id":"1712.00205","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00205","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00205v2","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00205","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"X3YAQ2HRTPVB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X3YAQ2HRTPVBLZGZ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X3YAQ2HR","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:1fefc8a49fcd97fa1093f5d276eb4f7940a7f009b3f7013cf0d6f987ff07ad0f","target":"graph","created_at":"2026-05-18T00:03:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Estimating the joint probability mass function (PMF) of a set of random variables lies at the heart of statistical learning and signal processing. Without structural assumptions, such as modeling the variables as a Markov chain, tree, or other graphical model, joint PMF estimation is often considered mission impossible - the number of unknowns grows exponentially with the number of variables. But who gives us the structural model? Is there a generic, `non-parametric' way to control joint PMF complexity without relying on a priori structural assumptions regarding the underlying probability mode","authors_text":"Nicholas D. Sidiropoulos, Nikos Kargas, Xiao Fu","cross_cats":["cs.IT","math.IT","math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-12-01T06:19:33Z","title":"Tensors, Learning, and 'Kolmogorov Extension' for Finite-alphabet Random Vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00205","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0c1bcd1f40e998a8d1ef1f5831cf9608c85fc51c5afac2b710bf2ee8119aaa08","target":"record","created_at":"2026-05-18T00:03:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"286c6f9729b2197ba11ea48769f6e9a998b176a2362e550e151b65868e7f55a0","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-12-01T06:19:33Z","title_canon_sha256":"a1ab5c2f834f99b82728ac9c089fff074d5ab5620fa5e27b0aa749d8070e88d3"},"schema_version":"1.0","source":{"id":"1712.00205","kind":"arxiv","version":2}},"canonical_sha256":"bef00868f19bea15e4d97be9f14011ec18c9b4367e3249d48c3619f233706bf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bef00868f19bea15e4d97be9f14011ec18c9b4367e3249d48c3619f233706bf3","first_computed_at":"2026-05-18T00:03:19.238672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:19.238672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pLGuy9Hecyx1Z1LXPu0WaBfptlGQrmuySNJrBGoY6f3gxQHz7W8/gt/iDMtErk2bVeu+WmxP/cs4W/WCRum0AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:19.239158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00205","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c1bcd1f40e998a8d1ef1f5831cf9608c85fc51c5afac2b710bf2ee8119aaa08","sha256:1fefc8a49fcd97fa1093f5d276eb4f7940a7f009b3f7013cf0d6f987ff07ad0f"],"state_sha256":"e3f7ce3c70dfd90138d5eb7adc1e99b698be6fe3a450ef331df1c62b688ee7c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wHfo5HW3lK4JrAhUixNrRC92oigoT6mbYZ3SL8XCa2EpBbwtqEsCg21EM30McbkYC5Gih1lhAcUsz3dfSUcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T10:58:12.142542Z","bundle_sha256":"29556ca799f168a4d50c599042f68a19360dc0bb7c83d789a883f281e2aebed4"}}