{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3GFAVTCSAHWVHQVQ3DJ32WFE7A","short_pith_number":"pith:3GFAVTCS","schema_version":"1.0","canonical_sha256":"d98a0acc5201ed53c2b0d8d3bd58a4f80920ab7210084537bd500c155a436a4a","source":{"kind":"arxiv","id":"2607.01057","version":1},"attestation_state":"computed","paper":{"title":"Characterizing and Identifying Separable Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Christopher Meek, Kayvan Sadeghi","submitted_at":"2026-07-01T15:22:03Z","abstract_excerpt":"We study a broad class of graphical models whose independencies correspond to vertex separation in mixed graphs with directed, undirected, and bidirected edges, that are capable of encoding independence structures arising from feedback, latent and selection mechanisms. In particular, we introduce separable graphs, in which each missing edge implies the existence of a separating set for its endpoints, and essentially separable graphs, those graphs separation equivalent to a separable graph. We show that these models include many existing graph families used to define graphical models an provide"},"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":"2607.01057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-07-01T15:22:03Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"d089d807689aae04fd46d26104249eace929e90056190e63fe81c4e216552b27","abstract_canon_sha256":"062deac336251d04fb40a98ead0f73c823623626a9271a33604f8dea431fc492"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:18:27.569650Z","signature_b64":"IkgCn7RwBCy2TRQogOHa7PklSfkHNb/WMXV2rfKYLa8soUhxrPUd7P1xQByYx3KZxj361Z4PkHfzREZtaZGqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98a0acc5201ed53c2b0d8d3bd58a4f80920ab7210084537bd500c155a436a4a","last_reissued_at":"2026-07-02T01:18:27.569223Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:18:27.569223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing and Identifying Separable Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Christopher Meek, Kayvan Sadeghi","submitted_at":"2026-07-01T15:22:03Z","abstract_excerpt":"We study a broad class of graphical models whose independencies correspond to vertex separation in mixed graphs with directed, undirected, and bidirected edges, that are capable of encoding independence structures arising from feedback, latent and selection mechanisms. In particular, we introduce separable graphs, in which each missing edge implies the existence of a separating set for its endpoints, and essentially separable graphs, those graphs separation equivalent to a separable graph. We show that these models include many existing graph families used to define graphical models an provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01057","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.01057/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.01057","created_at":"2026-07-02T01:18:27.569281+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.01057v1","created_at":"2026-07-02T01:18:27.569281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01057","created_at":"2026-07-02T01:18:27.569281+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GFAVTCSAHWV","created_at":"2026-07-02T01:18:27.569281+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GFAVTCSAHWVHQVQ","created_at":"2026-07-02T01:18:27.569281+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GFAVTCS","created_at":"2026-07-02T01:18:27.569281+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/3GFAVTCSAHWVHQVQ3DJ32WFE7A","json":"https://pith.science/pith/3GFAVTCSAHWVHQVQ3DJ32WFE7A.json","graph_json":"https://pith.science/api/pith-number/3GFAVTCSAHWVHQVQ3DJ32WFE7A/graph.json","events_json":"https://pith.science/api/pith-number/3GFAVTCSAHWVHQVQ3DJ32WFE7A/events.json","paper":"https://pith.science/paper/3GFAVTCS"},"agent_actions":{"view_html":"https://pith.science/pith/3GFAVTCSAHWVHQVQ3DJ32WFE7A","download_json":"https://pith.science/pith/3GFAVTCSAHWVHQVQ3DJ32WFE7A.json","view_paper":"https://pith.science/paper/3GFAVTCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.01057&json=true","fetch_graph":"https://pith.science/api/pith-number/3GFAVTCSAHWVHQVQ3DJ32WFE7A/graph.json","fetch_events":"https://pith.science/api/pith-number/3GFAVTCSAHWVHQVQ3DJ32WFE7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GFAVTCSAHWVHQVQ3DJ32WFE7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GFAVTCSAHWVHQVQ3DJ32WFE7A/action/storage_attestation","attest_author":"https://pith.science/pith/3GFAVTCSAHWVHQVQ3DJ32WFE7A/action/author_attestation","sign_citation":"https://pith.science/pith/3GFAVTCSAHWVHQVQ3DJ32WFE7A/action/citation_signature","submit_replication":"https://pith.science/pith/3GFAVTCSAHWVHQVQ3DJ32WFE7A/action/replication_record"}},"created_at":"2026-07-02T01:18:27.569281+00:00","updated_at":"2026-07-02T01:18:27.569281+00:00"}