{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:J5SUN52FMUUOLMO3Z2UUCXAAFR","short_pith_number":"pith:J5SUN52F","schema_version":"1.0","canonical_sha256":"4f6546f7456528e5b1dbcea9415c002c7da01f4746a83579f7ceb9c3657e752b","source":{"kind":"arxiv","id":"1310.1012","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic Aspects of Switch Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fabien de Montgolfier, Michel Habib, Vincent Cohen-Addad","submitted_at":"2013-10-03T15:43:08Z","abstract_excerpt":"This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n^2) decomposition algorithm and we take advantage of the involution modular decomposition tree to state several algorithmic results. Cographs are the graphs that are totally decomposable w.r.t modular decomposition. In a similar way, we introduce the class of switch cographs, the class of graphs that are totally decomposable w.r.t involution modular decomposition. This class generalizes the class of cogra"},"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":"1310.1012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-03T15:43:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"651b3a88ee25bb7f521cedeb0ee60f5ad53a7adf04ee0590b16bb7e95b28912a","abstract_canon_sha256":"9ba0fd4321f89f673194ec5386527d9a42904f5d3e5bdc2eaf74fd0e4deb4476"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:24.760645Z","signature_b64":"Wj/nbZvvUkwe9IQ1/O2PPOp7In9BqAlFq1G40TwlBzcH6fAu8iy7J7IUl3hmUkTvESWEs6fe4hHXWTa4OwvLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f6546f7456528e5b1dbcea9415c002c7da01f4746a83579f7ceb9c3657e752b","last_reissued_at":"2026-05-18T03:11:24.759984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:24.759984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Aspects of Switch Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fabien de Montgolfier, Michel Habib, Vincent Cohen-Addad","submitted_at":"2013-10-03T15:43:08Z","abstract_excerpt":"This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n^2) decomposition algorithm and we take advantage of the involution modular decomposition tree to state several algorithmic results. Cographs are the graphs that are totally decomposable w.r.t modular decomposition. In a similar way, we introduce the class of switch cographs, the class of graphs that are totally decomposable w.r.t involution modular decomposition. This class generalizes the class of cogra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1012","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1310.1012","created_at":"2026-05-18T03:11:24.760075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1012v1","created_at":"2026-05-18T03:11:24.760075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1012","created_at":"2026-05-18T03:11:24.760075+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5SUN52FMUUO","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5SUN52FMUUOLMO3","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5SUN52F","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J5SUN52FMUUOLMO3Z2UUCXAAFR","json":"https://pith.science/pith/J5SUN52FMUUOLMO3Z2UUCXAAFR.json","graph_json":"https://pith.science/api/pith-number/J5SUN52FMUUOLMO3Z2UUCXAAFR/graph.json","events_json":"https://pith.science/api/pith-number/J5SUN52FMUUOLMO3Z2UUCXAAFR/events.json","paper":"https://pith.science/paper/J5SUN52F"},"agent_actions":{"view_html":"https://pith.science/pith/J5SUN52FMUUOLMO3Z2UUCXAAFR","download_json":"https://pith.science/pith/J5SUN52FMUUOLMO3Z2UUCXAAFR.json","view_paper":"https://pith.science/paper/J5SUN52F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1012&json=true","fetch_graph":"https://pith.science/api/pith-number/J5SUN52FMUUOLMO3Z2UUCXAAFR/graph.json","fetch_events":"https://pith.science/api/pith-number/J5SUN52FMUUOLMO3Z2UUCXAAFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5SUN52FMUUOLMO3Z2UUCXAAFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5SUN52FMUUOLMO3Z2UUCXAAFR/action/storage_attestation","attest_author":"https://pith.science/pith/J5SUN52FMUUOLMO3Z2UUCXAAFR/action/author_attestation","sign_citation":"https://pith.science/pith/J5SUN52FMUUOLMO3Z2UUCXAAFR/action/citation_signature","submit_replication":"https://pith.science/pith/J5SUN52FMUUOLMO3Z2UUCXAAFR/action/replication_record"}},"created_at":"2026-05-18T03:11:24.760075+00:00","updated_at":"2026-05-18T03:11:24.760075+00:00"}