{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MTCSXTJKAKPR2RQQHEU5FHALIW","short_pith_number":"pith:MTCSXTJK","schema_version":"1.0","canonical_sha256":"64c52bcd2a029f1d46103929d29c0b458125e78bfe92b6b1663b96a7fa12a6a6","source":{"kind":"arxiv","id":"1612.05827","version":1},"attestation_state":"computed","paper":{"title":"Cograph generation with linear delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"\\'Atila A. Jones, F\\'abio Protti, Renata R. Del-Vecchio","submitted_at":"2016-12-17T21:32:44Z","abstract_excerpt":"Cographs have always been a research target in areas such as coloring, graph decomposition, and spectral theory. In this work, we present an algorithm to generate all unlabeled cographs with $n$ vertices, based on the generation of cotrees. The delay of our algorithm (time spent between two consecutive outputs) is $O(n)$. The time needed to generate the first output is also $O(n)$, which gives an overall $O(n\\,M_n)$ time complexity, where $M_n$ is the number of unlabeled cographs with $n$ vertices. The algorithm avoids the generation of duplicates (isomorphic outputs) and produces, as a by-pro"},"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":"1612.05827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-12-17T21:32:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ac87a6e98cae7f7262aae9bd457fba57d5c9df884a27dcc6b7c93dd7b24ff2d8","abstract_canon_sha256":"02bb1c722de33c725961a56cc0c7d090f2e3336e6c16a13c29f8fdaa47e0c755"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:03.394392Z","signature_b64":"fp4xGYx1hAd1ZTJpaZZ5wnC/RZZoLdnRUB2j026y1jzkMe9jjTQlvAjc6SZCIx1/D9QI3J/ys45Jydha5XsdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64c52bcd2a029f1d46103929d29c0b458125e78bfe92b6b1663b96a7fa12a6a6","last_reissued_at":"2026-05-18T00:02:03.393885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:03.393885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cograph generation with linear delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"\\'Atila A. Jones, F\\'abio Protti, Renata R. Del-Vecchio","submitted_at":"2016-12-17T21:32:44Z","abstract_excerpt":"Cographs have always been a research target in areas such as coloring, graph decomposition, and spectral theory. In this work, we present an algorithm to generate all unlabeled cographs with $n$ vertices, based on the generation of cotrees. The delay of our algorithm (time spent between two consecutive outputs) is $O(n)$. The time needed to generate the first output is also $O(n)$, which gives an overall $O(n\\,M_n)$ time complexity, where $M_n$ is the number of unlabeled cographs with $n$ vertices. The algorithm avoids the generation of duplicates (isomorphic outputs) and produces, as a by-pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05827","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":"1612.05827","created_at":"2026-05-18T00:02:03.393961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.05827v1","created_at":"2026-05-18T00:02:03.393961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05827","created_at":"2026-05-18T00:02:03.393961+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTCSXTJKAKPR","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTCSXTJKAKPR2RQQ","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTCSXTJK","created_at":"2026-05-18T12:30:32.724797+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/MTCSXTJKAKPR2RQQHEU5FHALIW","json":"https://pith.science/pith/MTCSXTJKAKPR2RQQHEU5FHALIW.json","graph_json":"https://pith.science/api/pith-number/MTCSXTJKAKPR2RQQHEU5FHALIW/graph.json","events_json":"https://pith.science/api/pith-number/MTCSXTJKAKPR2RQQHEU5FHALIW/events.json","paper":"https://pith.science/paper/MTCSXTJK"},"agent_actions":{"view_html":"https://pith.science/pith/MTCSXTJKAKPR2RQQHEU5FHALIW","download_json":"https://pith.science/pith/MTCSXTJKAKPR2RQQHEU5FHALIW.json","view_paper":"https://pith.science/paper/MTCSXTJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.05827&json=true","fetch_graph":"https://pith.science/api/pith-number/MTCSXTJKAKPR2RQQHEU5FHALIW/graph.json","fetch_events":"https://pith.science/api/pith-number/MTCSXTJKAKPR2RQQHEU5FHALIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTCSXTJKAKPR2RQQHEU5FHALIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTCSXTJKAKPR2RQQHEU5FHALIW/action/storage_attestation","attest_author":"https://pith.science/pith/MTCSXTJKAKPR2RQQHEU5FHALIW/action/author_attestation","sign_citation":"https://pith.science/pith/MTCSXTJKAKPR2RQQHEU5FHALIW/action/citation_signature","submit_replication":"https://pith.science/pith/MTCSXTJKAKPR2RQQHEU5FHALIW/action/replication_record"}},"created_at":"2026-05-18T00:02:03.393961+00:00","updated_at":"2026-05-18T00:02:03.393961+00:00"}