{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:C5V36OA44XJFORFRZWTJZVV7HW","short_pith_number":"pith:C5V36OA4","schema_version":"1.0","canonical_sha256":"176bbf381ce5d25744b1cda69cd6bf3d9496dfad67d671d8b02d07dd5331d177","source":{"kind":"arxiv","id":"2503.08245","version":3},"attestation_state":"computed","paper":{"title":"ExMAG: Learning of Maximally Ancestral Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Georgios Korpas, Jakub Mare\\v{c}ek, Pavel Ryt\\'i\\v{r}, Petr Ry\\v{s}av\\'y, Xiaoyu He","submitted_at":"2025-03-11T10:08:39Z","abstract_excerpt":"In mixed graphs, there are both directed and undirected edges. An extension of acyclicity to this mixed-graph setting is known as maximally ancestral graphs. This extension is of considerable interest in causal learning in the presence of confounders. There, directed edges represent a clear direction of causality, while undirected edges represent confounding. We propose a score-based branch-and-cut algorithm for learning maximally ancestral graphs. The algorithm produces more accurate results than state-of-the-art methods, while being faster to run on small and medium-sized synthetic instances"},"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":"2503.08245","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-11T10:08:39Z","cross_cats_sorted":[],"title_canon_sha256":"f529b2708af67d4f42662552592b7bd801e57e2c44fdc70a7cb46d20791ee376","abstract_canon_sha256":"0f97249817031902c8491df357f2b1a468cffc6df4e2579b0aa5677db9ce4d3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:21.654537Z","signature_b64":"bAk33puP3fJUSY3An6KwaMDv7xG8XW2RgrHRJtkY1ypKDuruG1dKp/fzY0FL7UPJ8d6DYS6I1hlK8fwMzkxhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"176bbf381ce5d25744b1cda69cd6bf3d9496dfad67d671d8b02d07dd5331d177","last_reissued_at":"2026-07-05T11:07:21.654038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:21.654038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ExMAG: Learning of Maximally Ancestral Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Georgios Korpas, Jakub Mare\\v{c}ek, Pavel Ryt\\'i\\v{r}, Petr Ry\\v{s}av\\'y, Xiaoyu He","submitted_at":"2025-03-11T10:08:39Z","abstract_excerpt":"In mixed graphs, there are both directed and undirected edges. An extension of acyclicity to this mixed-graph setting is known as maximally ancestral graphs. This extension is of considerable interest in causal learning in the presence of confounders. There, directed edges represent a clear direction of causality, while undirected edges represent confounding. We propose a score-based branch-and-cut algorithm for learning maximally ancestral graphs. The algorithm produces more accurate results than state-of-the-art methods, while being faster to run on small and medium-sized synthetic instances"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08245","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.08245/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":"2503.08245","created_at":"2026-07-05T11:07:21.654092+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.08245v3","created_at":"2026-07-05T11:07:21.654092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08245","created_at":"2026-07-05T11:07:21.654092+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5V36OA44XJF","created_at":"2026-07-05T11:07:21.654092+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5V36OA44XJFORFR","created_at":"2026-07-05T11:07:21.654092+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5V36OA4","created_at":"2026-07-05T11:07:21.654092+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/C5V36OA44XJFORFRZWTJZVV7HW","json":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW.json","graph_json":"https://pith.science/api/pith-number/C5V36OA44XJFORFRZWTJZVV7HW/graph.json","events_json":"https://pith.science/api/pith-number/C5V36OA44XJFORFRZWTJZVV7HW/events.json","paper":"https://pith.science/paper/C5V36OA4"},"agent_actions":{"view_html":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW","download_json":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW.json","view_paper":"https://pith.science/paper/C5V36OA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.08245&json=true","fetch_graph":"https://pith.science/api/pith-number/C5V36OA44XJFORFRZWTJZVV7HW/graph.json","fetch_events":"https://pith.science/api/pith-number/C5V36OA44XJFORFRZWTJZVV7HW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW/action/storage_attestation","attest_author":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW/action/author_attestation","sign_citation":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW/action/citation_signature","submit_replication":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW/action/replication_record"}},"created_at":"2026-07-05T11:07:21.654092+00:00","updated_at":"2026-07-05T11:07:21.654092+00:00"}