{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TZF4HLC23SAMIFTMV2PEZYWCQZ","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":"aca8d3f28be393e9ebee8a396fa9476d607ff03dca8350496b0ab24b715bc1bf","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-03-11T14:15:24Z","title_canon_sha256":"98e868999b220581497d089e57ac7ecd13e44844ca2bac96fc000b80a729f59c"},"schema_version":"1.0","source":{"id":"2103.06683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.06683","created_at":"2026-07-05T02:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"2103.06683v1","created_at":"2026-07-05T02:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.06683","created_at":"2026-07-05T02:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"TZF4HLC23SAM","created_at":"2026-07-05T02:22:18Z"},{"alias_kind":"pith_short_16","alias_value":"TZF4HLC23SAMIFTM","created_at":"2026-07-05T02:22:18Z"},{"alias_kind":"pith_short_8","alias_value":"TZF4HLC2","created_at":"2026-07-05T02:22:18Z"}],"graph_snapshots":[{"event_id":"sha256:852ffdf6a0995911a934b2fcae5ac1b72c9fc92f48ac98c6d76428e8cccaf23a","target":"graph","created_at":"2026-07-05T02:22:18Z","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/2103.06683/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The modular decomposition of a symmetric map $\\delta\\colon X\\times X \\to \\Upsilon$ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features of $\\delta$ in labeled trees. A map $\\delta$ is explained by a vertex-labeled rooted tree $(T,t)$ if the label $\\delta(x,y)$ coincides with the label of the last common ancestor of $x$ and $y$ in $T$, i.e., if $\\delta(x,y)=t(\\mathrm{lca}(x,y))$. Only maps whose modular decomposition does not contain prime nodes, i.e., the symbolic ultrametrics, can be exapl","authors_text":"Carmen Bruckmann, Marc Hellmuth, Peter F. Stadler","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-03-11T14:15:24Z","title":"From Modular Decomposition Trees to Rooted Median Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.06683","kind":"arxiv","version":1},"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:b13b01e2993b87f1ab9ffcafe8e6c3370fbd6d250977aa399f46f485d1a0379b","target":"record","created_at":"2026-07-05T02:22:18Z","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":"aca8d3f28be393e9ebee8a396fa9476d607ff03dca8350496b0ab24b715bc1bf","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-03-11T14:15:24Z","title_canon_sha256":"98e868999b220581497d089e57ac7ecd13e44844ca2bac96fc000b80a729f59c"},"schema_version":"1.0","source":{"id":"2103.06683","kind":"arxiv","version":1}},"canonical_sha256":"9e4bc3ac5adc80c4166cae9e4ce2c2866ba73e5250cc819712b574ebd0c206f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e4bc3ac5adc80c4166cae9e4ce2c2866ba73e5250cc819712b574ebd0c206f2","first_computed_at":"2026-07-05T02:22:18.363266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:22:18.363266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c1LgH7qaLXoseGDyNLCUY/YEIiZb8rAJ5pW57ma9vGhk2qYK3LSaVCXRp5l6j11F5LtP0JiAUYvftV/pKjZgBA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:22:18.363671Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.06683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b13b01e2993b87f1ab9ffcafe8e6c3370fbd6d250977aa399f46f485d1a0379b","sha256:852ffdf6a0995911a934b2fcae5ac1b72c9fc92f48ac98c6d76428e8cccaf23a"],"state_sha256":"3289827181b50c7bda7d574e386f51ef4f8ae2df55f91e2da685ac25386ff341"}