{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:NSIQGIPLRFWYG3UP5GT37XIW5T","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":"f6a54ee05dfd45af24220e0c60ccfe00b107104755978fd117cebd0207d70e40","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-30T09:55:31Z","title_canon_sha256":"cb1923ea4b0a9ff040554e83a8e6e3a5d88187b6125733b047ed58e9839ef68f"},"schema_version":"1.0","source":{"id":"2211.16854","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.16854","created_at":"2026-07-05T06:06:55Z"},{"alias_kind":"arxiv_version","alias_value":"2211.16854v3","created_at":"2026-07-05T06:06:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.16854","created_at":"2026-07-05T06:06:55Z"},{"alias_kind":"pith_short_12","alias_value":"NSIQGIPLRFWY","created_at":"2026-07-05T06:06:55Z"},{"alias_kind":"pith_short_16","alias_value":"NSIQGIPLRFWYG3UP","created_at":"2026-07-05T06:06:55Z"},{"alias_kind":"pith_short_8","alias_value":"NSIQGIPL","created_at":"2026-07-05T06:06:55Z"}],"graph_snapshots":[{"event_id":"sha256:c1dcecb6be35189bcc011713f59564511a608412a512fc5ed2d4f3adfdca523d","target":"graph","created_at":"2026-07-05T06:06:55Z","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/2211.16854/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The modular decomposition of a graph $G$ is a natural construction to capture key features of $G$ in terms of a labeled tree $(T,t)$ whose vertices are labeled as \"series\" ($1$), \"parallel\" ($0$) or \"prime\". However, full information of $G$ is provided by its modular decomposition tree $(T,t)$ only, if $G$ is a cograph, i.e., $G$ does not contain prime modules. In this case, $(T,t)$ explains $G$, i.e., $\\{x,y\\}\\in E(G)$ if and only if the lowest common ancestor $\\mathrm{lca}_T(x,y)$ of $x$ and $y$ has label \"$1$\". Pseudo-cographs, or, more general, GaTEx graphs $G$ are graphs that can be expla","authors_text":"Guillaume E. Scholz, Marc Hellmuth","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-30T09:55:31Z","title":"Resolving Prime Modules: The Structure of Pseudo-cographs and Galled-Tree Explainable Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.16854","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:daeaf097636b1a42d8fc3205d2b7cef73b1b300ff37c623f2e1e40b66f0ad7ff","target":"record","created_at":"2026-07-05T06:06:55Z","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":"f6a54ee05dfd45af24220e0c60ccfe00b107104755978fd117cebd0207d70e40","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-30T09:55:31Z","title_canon_sha256":"cb1923ea4b0a9ff040554e83a8e6e3a5d88187b6125733b047ed58e9839ef68f"},"schema_version":"1.0","source":{"id":"2211.16854","kind":"arxiv","version":3}},"canonical_sha256":"6c910321eb896d836e8fe9a7bfdd16ecd028e28a385d931ad57011aba607c39c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c910321eb896d836e8fe9a7bfdd16ecd028e28a385d931ad57011aba607c39c","first_computed_at":"2026-07-05T06:06:55.268474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:06:55.268474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xxJVaPZHy6xFzXDEAw8cSmW8X264uuf2JD47wk6WmcOHEp2sXNCftZr/IWfKq1BChCgBV7ZJsafku2vMTPPMAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:06:55.268860Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.16854","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:daeaf097636b1a42d8fc3205d2b7cef73b1b300ff37c623f2e1e40b66f0ad7ff","sha256:c1dcecb6be35189bcc011713f59564511a608412a512fc5ed2d4f3adfdca523d"],"state_sha256":"8657d9f012b12f99e5c2a27c3be342bf4b75af3ae9ea63b4bd90fa8d997a6f39"}