{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AO7ZBD5UZUQOXKOQ5IBTECYVQC","short_pith_number":"pith:AO7ZBD5U","canonical_record":{"source":{"id":"1404.6617","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-04-26T07:03:00Z","cross_cats_sorted":[],"title_canon_sha256":"d4b355da81b0a7700f71c5fc50ee447c009e56f71fa74ef3fb9fe2dd38c5b4c7","abstract_canon_sha256":"99cc2cefd5c1f55c3d88f9a0cb42c2a0963b59587ca776fd0381ee984ce2e30d"},"schema_version":"1.0"},"canonical_sha256":"03bf908fb4cd20eba9d0ea03320b15808d80d840049cd0c37637616759112bb2","source":{"kind":"arxiv","id":"1404.6617","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6617","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6617v3","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6617","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"AO7ZBD5UZUQO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AO7ZBD5UZUQOXKOQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AO7ZBD5U","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AO7ZBD5UZUQOXKOQ5IBTECYVQC","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6617","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-04-26T07:03:00Z","cross_cats_sorted":[],"title_canon_sha256":"d4b355da81b0a7700f71c5fc50ee447c009e56f71fa74ef3fb9fe2dd38c5b4c7","abstract_canon_sha256":"99cc2cefd5c1f55c3d88f9a0cb42c2a0963b59587ca776fd0381ee984ce2e30d"},"schema_version":"1.0"},"canonical_sha256":"03bf908fb4cd20eba9d0ea03320b15808d80d840049cd0c37637616759112bb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:54.048769Z","signature_b64":"BsxD3MxBDlulGQyioVizANcwpfcVw0/KKz48hua02wPJzVm18TAWXb1dsOJzeQa/dC9EziDHP41JStkatidgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03bf908fb4cd20eba9d0ea03320b15808d80d840049cd0c37637616759112bb2","last_reissued_at":"2026-05-18T02:28:54.048331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:54.048331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6617","source_version":3,"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-18T02:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IWC+4xysnGuL0S9BdJJX70XZestJMqzZXTSw6w51RHQH06E+OWFrez2DEqh4MONkGudND273paz6FYKDBZjrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:06:28.521540Z"},"content_sha256":"47074cac6d8833751d3d38ba2287dc9120806f6ec63ebe52208a3cc78c7fefb0","schema_version":"1.0","event_id":"sha256:47074cac6d8833751d3d38ba2287dc9120806f6ec63ebe52208a3cc78c7fefb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AO7ZBD5UZUQOXKOQ5IBTECYVQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faithfulness and learning hypergraphs from discrete distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Anna Klimova, Caroline Uhler, Tamas Rudas","submitted_at":"2014-04-26T07:03:00Z","abstract_excerpt":"The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing hierarchical log-linear models are considered instead, and the concept of parametric (strong-) faithfulness with respect to a hypergraph is introduced. Strong-faithfulness ensures the existence of uniformly consistent parameter estimators and enables building uniformly consistent procedures for a hypergraph search. The strength of association in a discrete distribu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6617","kind":"arxiv","version":3},"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-18T02:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKf+6bgNreLAQX9NGSX6frii1cTI24OOmUDW8WvqJruMh9BvaDOtnkSNB83/TvHOFGTnPzgplb+xsPiqyJBXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:06:28.521884Z"},"content_sha256":"efc4db66d3feffd7afc999e3de544443d4deab8710e5bbcaa5960eeb74795a5e","schema_version":"1.0","event_id":"sha256:efc4db66d3feffd7afc999e3de544443d4deab8710e5bbcaa5960eeb74795a5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AO7ZBD5UZUQOXKOQ5IBTECYVQC/bundle.json","state_url":"https://pith.science/pith/AO7ZBD5UZUQOXKOQ5IBTECYVQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AO7ZBD5UZUQOXKOQ5IBTECYVQC/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-06-27T10:06:28Z","links":{"resolver":"https://pith.science/pith/AO7ZBD5UZUQOXKOQ5IBTECYVQC","bundle":"https://pith.science/pith/AO7ZBD5UZUQOXKOQ5IBTECYVQC/bundle.json","state":"https://pith.science/pith/AO7ZBD5UZUQOXKOQ5IBTECYVQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AO7ZBD5UZUQOXKOQ5IBTECYVQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AO7ZBD5UZUQOXKOQ5IBTECYVQC","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":"99cc2cefd5c1f55c3d88f9a0cb42c2a0963b59587ca776fd0381ee984ce2e30d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-04-26T07:03:00Z","title_canon_sha256":"d4b355da81b0a7700f71c5fc50ee447c009e56f71fa74ef3fb9fe2dd38c5b4c7"},"schema_version":"1.0","source":{"id":"1404.6617","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6617","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6617v3","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6617","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"AO7ZBD5UZUQO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AO7ZBD5UZUQOXKOQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AO7ZBD5U","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:efc4db66d3feffd7afc999e3de544443d4deab8710e5bbcaa5960eeb74795a5e","target":"graph","created_at":"2026-05-18T02:28:54Z","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":"The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing hierarchical log-linear models are considered instead, and the concept of parametric (strong-) faithfulness with respect to a hypergraph is introduced. Strong-faithfulness ensures the existence of uniformly consistent parameter estimators and enables building uniformly consistent procedures for a hypergraph search. The strength of association in a discrete distribu","authors_text":"Anna Klimova, Caroline Uhler, Tamas Rudas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-04-26T07:03:00Z","title":"Faithfulness and learning hypergraphs from discrete distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6617","kind":"arxiv","version":3},"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:47074cac6d8833751d3d38ba2287dc9120806f6ec63ebe52208a3cc78c7fefb0","target":"record","created_at":"2026-05-18T02:28:54Z","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":"99cc2cefd5c1f55c3d88f9a0cb42c2a0963b59587ca776fd0381ee984ce2e30d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-04-26T07:03:00Z","title_canon_sha256":"d4b355da81b0a7700f71c5fc50ee447c009e56f71fa74ef3fb9fe2dd38c5b4c7"},"schema_version":"1.0","source":{"id":"1404.6617","kind":"arxiv","version":3}},"canonical_sha256":"03bf908fb4cd20eba9d0ea03320b15808d80d840049cd0c37637616759112bb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03bf908fb4cd20eba9d0ea03320b15808d80d840049cd0c37637616759112bb2","first_computed_at":"2026-05-18T02:28:54.048331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:54.048331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BsxD3MxBDlulGQyioVizANcwpfcVw0/KKz48hua02wPJzVm18TAWXb1dsOJzeQa/dC9EziDHP41JStkatidgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:54.048769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6617","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47074cac6d8833751d3d38ba2287dc9120806f6ec63ebe52208a3cc78c7fefb0","sha256:efc4db66d3feffd7afc999e3de544443d4deab8710e5bbcaa5960eeb74795a5e"],"state_sha256":"effab62109ef28337932af0b5da9fedc44fcbdef4ab238b42154e988d2ad3f05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LgdX+2eFT3zxrsu20Dp7Fae9hdWI0gQwwC6GczvPvDB9Ky5pkGokANvgXmQaIGgKWXjKcMrhP4cXRxDzl0MiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T10:06:28.523727Z","bundle_sha256":"fb3bcfc4829570b4a9642f3be2cb15ee9e405950cbd4da5faa3d9c9cf8248504"}}