{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:C5V36OA44XJFORFRZWTJZVV7HW","short_pith_number":"pith:C5V36OA4","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"},"canonical_sha256":"176bbf381ce5d25744b1cda69cd6bf3d9496dfad67d671d8b02d07dd5331d177","source":{"kind":"arxiv","id":"2503.08245","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.08245","created_at":"2026-07-05T11:07:21Z"},{"alias_kind":"arxiv_version","alias_value":"2503.08245v3","created_at":"2026-07-05T11:07:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08245","created_at":"2026-07-05T11:07:21Z"},{"alias_kind":"pith_short_12","alias_value":"C5V36OA44XJF","created_at":"2026-07-05T11:07:21Z"},{"alias_kind":"pith_short_16","alias_value":"C5V36OA44XJFORFR","created_at":"2026-07-05T11:07:21Z"},{"alias_kind":"pith_short_8","alias_value":"C5V36OA4","created_at":"2026-07-05T11:07:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:C5V36OA44XJFORFRZWTJZVV7HW","target":"record","payload":{"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"},"canonical_sha256":"176bbf381ce5d25744b1cda69cd6bf3d9496dfad67d671d8b02d07dd5331d177","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"},"source_kind":"arxiv","source_id":"2503.08245","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-07-05T11:07:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5nzXdL12TnbuEIv7Ye3wluJluM/9j8ae1iYe/J3O//ODrSVa9E0oiMwtiTcr8JyAEI+3WeKyyfM2ydI0rbQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:11:57.772537Z"},"content_sha256":"4224b1f012fb80569ac7327684c333eb9795c2a8bbf0503a81996bcf0bb3a60a","schema_version":"1.0","event_id":"sha256:4224b1f012fb80569ac7327684c333eb9795c2a8bbf0503a81996bcf0bb3a60a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:C5V36OA44XJFORFRZWTJZVV7HW","target":"graph","payload":{"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"},"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-07-05T11:07:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69EbyjuVd5926XUXp3MTv8d/G3okW1waW6B2zWxUimJVSBUd3bTCHrVOPkQNFeHeO5JT523YrbxQdkXWaNmfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:11:57.772916Z"},"content_sha256":"afc8f191a4e94471467236480643474a596f59ba5908b35c6212954e598b284e","schema_version":"1.0","event_id":"sha256:afc8f191a4e94471467236480643474a596f59ba5908b35c6212954e598b284e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW/bundle.json","state_url":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5V36OA44XJFORFRZWTJZVV7HW/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-07-07T04:11:57Z","links":{"resolver":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW","bundle":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW/bundle.json","state":"https://pith.science/pith/C5V36OA44XJFORFRZWTJZVV7HW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5V36OA44XJFORFRZWTJZVV7HW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:C5V36OA44XJFORFRZWTJZVV7HW","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":"0f97249817031902c8491df357f2b1a468cffc6df4e2579b0aa5677db9ce4d3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-11T10:08:39Z","title_canon_sha256":"f529b2708af67d4f42662552592b7bd801e57e2c44fdc70a7cb46d20791ee376"},"schema_version":"1.0","source":{"id":"2503.08245","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.08245","created_at":"2026-07-05T11:07:21Z"},{"alias_kind":"arxiv_version","alias_value":"2503.08245v3","created_at":"2026-07-05T11:07:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08245","created_at":"2026-07-05T11:07:21Z"},{"alias_kind":"pith_short_12","alias_value":"C5V36OA44XJF","created_at":"2026-07-05T11:07:21Z"},{"alias_kind":"pith_short_16","alias_value":"C5V36OA44XJFORFR","created_at":"2026-07-05T11:07:21Z"},{"alias_kind":"pith_short_8","alias_value":"C5V36OA4","created_at":"2026-07-05T11:07:21Z"}],"graph_snapshots":[{"event_id":"sha256:afc8f191a4e94471467236480643474a596f59ba5908b35c6212954e598b284e","target":"graph","created_at":"2026-07-05T11:07:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.08245/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Georgios Korpas, Jakub Mare\\v{c}ek, Pavel Ryt\\'i\\v{r}, Petr Ry\\v{s}av\\'y, Xiaoyu He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-11T10:08:39Z","title":"ExMAG: Learning of Maximally Ancestral Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08245","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:4224b1f012fb80569ac7327684c333eb9795c2a8bbf0503a81996bcf0bb3a60a","target":"record","created_at":"2026-07-05T11:07:21Z","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":"0f97249817031902c8491df357f2b1a468cffc6df4e2579b0aa5677db9ce4d3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-11T10:08:39Z","title_canon_sha256":"f529b2708af67d4f42662552592b7bd801e57e2c44fdc70a7cb46d20791ee376"},"schema_version":"1.0","source":{"id":"2503.08245","kind":"arxiv","version":3}},"canonical_sha256":"176bbf381ce5d25744b1cda69cd6bf3d9496dfad67d671d8b02d07dd5331d177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"176bbf381ce5d25744b1cda69cd6bf3d9496dfad67d671d8b02d07dd5331d177","first_computed_at":"2026-07-05T11:07:21.654038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:07:21.654038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bAk33puP3fJUSY3An6KwaMDv7xG8XW2RgrHRJtkY1ypKDuruG1dKp/fzY0FL7UPJ8d6DYS6I1hlK8fwMzkxhAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:07:21.654537Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.08245","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4224b1f012fb80569ac7327684c333eb9795c2a8bbf0503a81996bcf0bb3a60a","sha256:afc8f191a4e94471467236480643474a596f59ba5908b35c6212954e598b284e"],"state_sha256":"7725d34703c6dab01644a3fbbf0aaaeaa1edfd4717c4ada088d94d1a95aba113"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1/IM+Oh92CqWWH3jzjOSbIuuVDJS+IbSwWCMHBIE07p8oKTNCW3IpTxVL1ZOxKn/uuBVtLetlwo7y2vBWixAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:11:57.775070Z","bundle_sha256":"ffe2907f391cc6552967afe7e56b0d2bcdd5fa338b147215e5db07b7e311aec1"}}