{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NSIQGIPLRFWYG3UP5GT37XIW5T","short_pith_number":"pith:NSIQGIPL","schema_version":"1.0","canonical_sha256":"6c910321eb896d836e8fe9a7bfdd16ecd028e28a385d931ad57011aba607c39c","source":{"kind":"arxiv","id":"2211.16854","version":3},"attestation_state":"computed","paper":{"title":"Resolving Prime Modules: The Structure of Pseudo-cographs and Galled-Tree Explainable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guillaume E. Scholz, Marc Hellmuth","submitted_at":"2022-11-30T09:55:31Z","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"},"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":"2211.16854","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-30T09:55:31Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cb1923ea4b0a9ff040554e83a8e6e3a5d88187b6125733b047ed58e9839ef68f","abstract_canon_sha256":"f6a54ee05dfd45af24220e0c60ccfe00b107104755978fd117cebd0207d70e40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:55.268860Z","signature_b64":"xxJVaPZHy6xFzXDEAw8cSmW8X264uuf2JD47wk6WmcOHEp2sXNCftZr/IWfKq1BChCgBV7ZJsafku2vMTPPMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c910321eb896d836e8fe9a7bfdd16ecd028e28a385d931ad57011aba607c39c","last_reissued_at":"2026-07-05T06:06:55.268474Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:55.268474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resolving Prime Modules: The Structure of Pseudo-cographs and Galled-Tree Explainable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guillaume E. Scholz, Marc Hellmuth","submitted_at":"2022-11-30T09:55:31Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.16854","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/2211.16854/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":"2211.16854","created_at":"2026-07-05T06:06:55.268536+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.16854v3","created_at":"2026-07-05T06:06:55.268536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.16854","created_at":"2026-07-05T06:06:55.268536+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSIQGIPLRFWY","created_at":"2026-07-05T06:06:55.268536+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSIQGIPLRFWYG3UP","created_at":"2026-07-05T06:06:55.268536+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSIQGIPL","created_at":"2026-07-05T06:06:55.268536+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08251","citing_title":"Representing distance-hereditary graphs with multi-rooted trees","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NSIQGIPLRFWYG3UP5GT37XIW5T","json":"https://pith.science/pith/NSIQGIPLRFWYG3UP5GT37XIW5T.json","graph_json":"https://pith.science/api/pith-number/NSIQGIPLRFWYG3UP5GT37XIW5T/graph.json","events_json":"https://pith.science/api/pith-number/NSIQGIPLRFWYG3UP5GT37XIW5T/events.json","paper":"https://pith.science/paper/NSIQGIPL"},"agent_actions":{"view_html":"https://pith.science/pith/NSIQGIPLRFWYG3UP5GT37XIW5T","download_json":"https://pith.science/pith/NSIQGIPLRFWYG3UP5GT37XIW5T.json","view_paper":"https://pith.science/paper/NSIQGIPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.16854&json=true","fetch_graph":"https://pith.science/api/pith-number/NSIQGIPLRFWYG3UP5GT37XIW5T/graph.json","fetch_events":"https://pith.science/api/pith-number/NSIQGIPLRFWYG3UP5GT37XIW5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSIQGIPLRFWYG3UP5GT37XIW5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSIQGIPLRFWYG3UP5GT37XIW5T/action/storage_attestation","attest_author":"https://pith.science/pith/NSIQGIPLRFWYG3UP5GT37XIW5T/action/author_attestation","sign_citation":"https://pith.science/pith/NSIQGIPLRFWYG3UP5GT37XIW5T/action/citation_signature","submit_replication":"https://pith.science/pith/NSIQGIPLRFWYG3UP5GT37XIW5T/action/replication_record"}},"created_at":"2026-07-05T06:06:55.268536+00:00","updated_at":"2026-07-05T06:06:55.268536+00:00"}