{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:LJ6USOI7LIFXFZ5HLFODNSN57B","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":"8eddd90980dfa0ed5d7f1178d4275c2e3e9df9c7a9d5b204959300ef0bee5158","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-12-10T13:41:31Z","title_canon_sha256":"5bc9d0f077ecc199cd142dc27ec74a70e54b77da73673e973cde24b115a526e7"},"schema_version":"1.0","source":{"id":"2112.05537","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.05537","created_at":"2026-07-05T04:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"2112.05537v3","created_at":"2026-07-05T04:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.05537","created_at":"2026-07-05T04:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"LJ6USOI7LIFX","created_at":"2026-07-05T04:31:58Z"},{"alias_kind":"pith_short_16","alias_value":"LJ6USOI7LIFXFZ5H","created_at":"2026-07-05T04:31:58Z"},{"alias_kind":"pith_short_8","alias_value":"LJ6USOI7","created_at":"2026-07-05T04:31:58Z"}],"graph_snapshots":[{"event_id":"sha256:ff8480baa24be53b945805035acdb04197712d9a1924fed65166007bce4166b8","target":"graph","created_at":"2026-07-05T04:31:58Z","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/2112.05537/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$ 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$\". This information, however, gets lost whenever $(T,t)$ contains vertices with label \"prime\". In this cont","authors_text":"Guillaume E. Scholz, Marc Hellmuth","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-12-10T13:41:31Z","title":"From Modular Decomposition Trees to Level-1 Networks: Pseudo-Cographs, Polar-Cats and Prime Polar-Cats"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.05537","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:a24ea94e4514e6238ace205e92b92ef93bed831180fceda5af9e7a8c1061f74d","target":"record","created_at":"2026-07-05T04:31:58Z","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":"8eddd90980dfa0ed5d7f1178d4275c2e3e9df9c7a9d5b204959300ef0bee5158","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-12-10T13:41:31Z","title_canon_sha256":"5bc9d0f077ecc199cd142dc27ec74a70e54b77da73673e973cde24b115a526e7"},"schema_version":"1.0","source":{"id":"2112.05537","kind":"arxiv","version":3}},"canonical_sha256":"5a7d49391f5a0b72e7a7595c36c9bdf86ce9defd4f623540509f7e69eec29e3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a7d49391f5a0b72e7a7595c36c9bdf86ce9defd4f623540509f7e69eec29e3c","first_computed_at":"2026-07-05T04:31:58.336984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:31:58.336984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EqzPEn8rtdPI13/927rDwJR/8vtPdPrGDrqdNyFYyURPzMAvm28vEdaRIN9+2mOrmXbYRlYoJ52orv1iKEG8Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:31:58.337481Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.05537","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a24ea94e4514e6238ace205e92b92ef93bed831180fceda5af9e7a8c1061f74d","sha256:ff8480baa24be53b945805035acdb04197712d9a1924fed65166007bce4166b8"],"state_sha256":"870393911106695fbbbf6916573e846a489b031506dab9be780cbff56ba74269"}