{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7F3LUE7FSZ5AWBPSWU4ODJU4VD","short_pith_number":"pith:7F3LUE7F","canonical_record":{"source":{"id":"1009.4279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-09-22T07:10:42Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"6de3c6e301440e25bdb7ef5a10df92fec84f9998a650faa1962a7d4ea7a89013","abstract_canon_sha256":"d19a3bbc49ff655a83e5425f9d3f8f1bd3b961fb66238caaf6b55bf3a87ef6bd"},"schema_version":"1.0"},"canonical_sha256":"f976ba13e5967a0b05f2b538e1a69ca8fcfbbd0c8a6ae9e818fe954142fdd5f0","source":{"kind":"arxiv","id":"1009.4279","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4279","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4279v2","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4279","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"7F3LUE7FSZ5A","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7F3LUE7FSZ5AWBPS","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7F3LUE7F","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7F3LUE7FSZ5AWBPSWU4ODJU4VD","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-09-22T07:10:42Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"6de3c6e301440e25bdb7ef5a10df92fec84f9998a650faa1962a7d4ea7a89013","abstract_canon_sha256":"d19a3bbc49ff655a83e5425f9d3f8f1bd3b961fb66238caaf6b55bf3a87ef6bd"},"schema_version":"1.0"},"canonical_sha256":"f976ba13e5967a0b05f2b538e1a69ca8fcfbbd0c8a6ae9e818fe954142fdd5f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:07.900988Z","signature_b64":"fRWUPLpePc6mFodFj7Hp6R/7i0EzDrp7OIKEbeQMpMYMR4ky2gph4iV6U9vtQH2CI+OiZO3mbGnMGD6zSTWkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f976ba13e5967a0b05f2b538e1a69ca8fcfbbd0c8a6ae9e818fe954142fdd5f0","last_reissued_at":"2026-05-18T03:05:07.900474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:07.900474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4279","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-18T03:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RgpMh0Mu1aEgeV9WqZJdvK7sQLjS16lA5EJ40HD9nYaCXBGHDIUiBo7ZTS0UsOjsXVkw0ND2QAYmejnTppwKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:10:08.817029Z"},"content_sha256":"3d1dc1308138f89123ed2efeaf72a46c1e63fbf3737c765e54ffbef7227b131c","schema_version":"1.0","event_id":"sha256:3d1dc1308138f89123ed2efeaf72a46c1e63fbf3737c765e54ffbef7227b131c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7F3LUE7FSZ5AWBPSWU4ODJU4VD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identification of discrete concentration graph models with one hidden binary variable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Barbara Vantaggi, Elena Stanghellini","submitted_at":"2010-09-22T07:10:42Z","abstract_excerpt":"Conditions are presented for different types of identifiability of discrete variable models generated over an undirected graph in which one node represents a binary hidden variable. These models can be seen as extensions of the latent class model to allow for conditional associations between the observable random variables. Since local identification corresponds to full rank of the parametrization map, we establish a necessary and sufficient condition for the rank to be full everywhere in the parameter space. The condition is based on the topology of the undirected graph associated to the mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4279","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-18T03:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EnYGq2j3iq93nEvmD3qPnsacv6wFyt8tBCyKIOXTj57MmJxl2q9reRmbbolL9xfqNgoGfnvgpJ1fk5llXo7hCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:10:08.817396Z"},"content_sha256":"a0e2e31f77f304ce6fbd7d9e6c1c6418161d65ce22e06f1656eccd26520bbc56","schema_version":"1.0","event_id":"sha256:a0e2e31f77f304ce6fbd7d9e6c1c6418161d65ce22e06f1656eccd26520bbc56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7F3LUE7FSZ5AWBPSWU4ODJU4VD/bundle.json","state_url":"https://pith.science/pith/7F3LUE7FSZ5AWBPSWU4ODJU4VD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7F3LUE7FSZ5AWBPSWU4ODJU4VD/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-12T10:10:08Z","links":{"resolver":"https://pith.science/pith/7F3LUE7FSZ5AWBPSWU4ODJU4VD","bundle":"https://pith.science/pith/7F3LUE7FSZ5AWBPSWU4ODJU4VD/bundle.json","state":"https://pith.science/pith/7F3LUE7FSZ5AWBPSWU4ODJU4VD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7F3LUE7FSZ5AWBPSWU4ODJU4VD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7F3LUE7FSZ5AWBPSWU4ODJU4VD","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":"d19a3bbc49ff655a83e5425f9d3f8f1bd3b961fb66238caaf6b55bf3a87ef6bd","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-09-22T07:10:42Z","title_canon_sha256":"6de3c6e301440e25bdb7ef5a10df92fec84f9998a650faa1962a7d4ea7a89013"},"schema_version":"1.0","source":{"id":"1009.4279","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4279","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4279v2","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4279","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"7F3LUE7FSZ5A","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7F3LUE7FSZ5AWBPS","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7F3LUE7F","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:a0e2e31f77f304ce6fbd7d9e6c1c6418161d65ce22e06f1656eccd26520bbc56","target":"graph","created_at":"2026-05-18T03:05:07Z","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":"Conditions are presented for different types of identifiability of discrete variable models generated over an undirected graph in which one node represents a binary hidden variable. These models can be seen as extensions of the latent class model to allow for conditional associations between the observable random variables. Since local identification corresponds to full rank of the parametrization map, we establish a necessary and sufficient condition for the rank to be full everywhere in the parameter space. The condition is based on the topology of the undirected graph associated to the mode","authors_text":"Barbara Vantaggi, Elena Stanghellini","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-09-22T07:10:42Z","title":"Identification of discrete concentration graph models with one hidden binary variable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4279","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:3d1dc1308138f89123ed2efeaf72a46c1e63fbf3737c765e54ffbef7227b131c","target":"record","created_at":"2026-05-18T03:05:07Z","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":"d19a3bbc49ff655a83e5425f9d3f8f1bd3b961fb66238caaf6b55bf3a87ef6bd","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-09-22T07:10:42Z","title_canon_sha256":"6de3c6e301440e25bdb7ef5a10df92fec84f9998a650faa1962a7d4ea7a89013"},"schema_version":"1.0","source":{"id":"1009.4279","kind":"arxiv","version":2}},"canonical_sha256":"f976ba13e5967a0b05f2b538e1a69ca8fcfbbd0c8a6ae9e818fe954142fdd5f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f976ba13e5967a0b05f2b538e1a69ca8fcfbbd0c8a6ae9e818fe954142fdd5f0","first_computed_at":"2026-05-18T03:05:07.900474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:07.900474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fRWUPLpePc6mFodFj7Hp6R/7i0EzDrp7OIKEbeQMpMYMR4ky2gph4iV6U9vtQH2CI+OiZO3mbGnMGD6zSTWkDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:07.900988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4279","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d1dc1308138f89123ed2efeaf72a46c1e63fbf3737c765e54ffbef7227b131c","sha256:a0e2e31f77f304ce6fbd7d9e6c1c6418161d65ce22e06f1656eccd26520bbc56"],"state_sha256":"2a9e99c3d43d89d0ec80bc69d92c930ec0f8acb226746551aefa5f8bcdad836f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKjNq7OsupTi6v/W7+CqANQppfWsLFxIj+AVWDqBfv8LPMKJTdgjGPOmCfyELDyW1HIoL3Hf6cXpEM7tF1jPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:10:08.819521Z","bundle_sha256":"26fcf99c09b7b9dd4683e1823de6e2e9e0469d52f5a61afaca3e36b08fd1dc0c"}}