{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JQDJPJDVOLUC3FHDTWB254EM3X","short_pith_number":"pith:JQDJPJDV","schema_version":"1.0","canonical_sha256":"4c0697a47572e82d94e39d83aef08cdddea3d167be13dcdc6120bad75b95e3fe","source":{"kind":"arxiv","id":"1806.11103","version":1},"attestation_state":"computed","paper":{"title":"Comment on: Decomposition of structural learning about directed acyclic graphs [1]","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marco Valtorta, Mohammad Ali Javidian","submitted_at":"2018-06-27T19:37:33Z","abstract_excerpt":"We propose an alternative proof concerning necessary and sufficient conditions to split the problem of searching for d-separators and building the skeleton of a DAG into small problems for every node of a separation tree T. The proof is simpler than the original [1]. The same proof structure has been used in [2] for learning the structure of multivariate regression chain graphs (MVR CGs)."},"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":"1806.11103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-27T19:37:33Z","cross_cats_sorted":[],"title_canon_sha256":"4e8ae8e4ed9b36d7ca395b02819592fc024c5ccab60da4f76584538e9832d4cd","abstract_canon_sha256":"52bd36bf0b6e2833a973628fd8732a0d89bdc7ec9344803568d0dabcd7a7e549"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:03.554070Z","signature_b64":"2x7of3oQ3uerqkMMlna62SZUJ35i9lr02f4IbvXXpOx/XIxf9EPc7gQT97ZgM1zia42b3x9bWDsbYShRCpi1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c0697a47572e82d94e39d83aef08cdddea3d167be13dcdc6120bad75b95e3fe","last_reissued_at":"2026-05-18T00:12:03.553408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:03.553408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comment on: Decomposition of structural learning about directed acyclic graphs [1]","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marco Valtorta, Mohammad Ali Javidian","submitted_at":"2018-06-27T19:37:33Z","abstract_excerpt":"We propose an alternative proof concerning necessary and sufficient conditions to split the problem of searching for d-separators and building the skeleton of a DAG into small problems for every node of a separation tree T. The proof is simpler than the original [1]. The same proof structure has been used in [2] for learning the structure of multivariate regression chain graphs (MVR CGs)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11103","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":"1806.11103","created_at":"2026-05-18T00:12:03.553495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.11103v1","created_at":"2026-05-18T00:12:03.553495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11103","created_at":"2026-05-18T00:12:03.553495+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQDJPJDVOLUC","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQDJPJDVOLUC3FHD","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQDJPJDV","created_at":"2026-05-18T12:32:31.084164+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/JQDJPJDVOLUC3FHDTWB254EM3X","json":"https://pith.science/pith/JQDJPJDVOLUC3FHDTWB254EM3X.json","graph_json":"https://pith.science/api/pith-number/JQDJPJDVOLUC3FHDTWB254EM3X/graph.json","events_json":"https://pith.science/api/pith-number/JQDJPJDVOLUC3FHDTWB254EM3X/events.json","paper":"https://pith.science/paper/JQDJPJDV"},"agent_actions":{"view_html":"https://pith.science/pith/JQDJPJDVOLUC3FHDTWB254EM3X","download_json":"https://pith.science/pith/JQDJPJDVOLUC3FHDTWB254EM3X.json","view_paper":"https://pith.science/paper/JQDJPJDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.11103&json=true","fetch_graph":"https://pith.science/api/pith-number/JQDJPJDVOLUC3FHDTWB254EM3X/graph.json","fetch_events":"https://pith.science/api/pith-number/JQDJPJDVOLUC3FHDTWB254EM3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQDJPJDVOLUC3FHDTWB254EM3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQDJPJDVOLUC3FHDTWB254EM3X/action/storage_attestation","attest_author":"https://pith.science/pith/JQDJPJDVOLUC3FHDTWB254EM3X/action/author_attestation","sign_citation":"https://pith.science/pith/JQDJPJDVOLUC3FHDTWB254EM3X/action/citation_signature","submit_replication":"https://pith.science/pith/JQDJPJDVOLUC3FHDTWB254EM3X/action/replication_record"}},"created_at":"2026-05-18T00:12:03.553495+00:00","updated_at":"2026-05-18T00:12:03.553495+00:00"}