{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IE5EQAX6JMHXGHXB3W37HANYKX","short_pith_number":"pith:IE5EQAX6","schema_version":"1.0","canonical_sha256":"413a4802fe4b0f731ee1ddb7f381b855edcdd896b24a6ff7c93bc58464294666","source":{"kind":"arxiv","id":"1711.01483","version":2},"attestation_state":"computed","paper":{"title":"Classes of graphs without star forests and related graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aistis Atminas","submitted_at":"2017-11-04T19:48:09Z","abstract_excerpt":"This work provides a structural characterisation of hereditary graph classes that do not contain a star forest, several graphs obtained from star forests by subset complementation, a union of cliques, and the complement of a union of cliques as induced subgraphs. This provides, for instance, structural results for graph classes not containing a matching and several complements of a matching. In terms of the speed of hereditary graph classes, our results imply that all such classes have at most factorial speed of growth."},"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":"1711.01483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-04T19:48:09Z","cross_cats_sorted":[],"title_canon_sha256":"d2b608d89a12c02369814838cc6d5460ed973833b1d052e59756d32692645294","abstract_canon_sha256":"012806b2c7b5b6903f43998dede0a863393f94bfc1b775b66e4cbecb3ada8e6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:02.182575Z","signature_b64":"ysR232htSf2Z5mpA9xKN0k82mAELtxaXWyEDrkOTOqPV8f9HodSNp2sve3AIOeRPyge7T8o03X6OJ0lrQZyOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"413a4802fe4b0f731ee1ddb7f381b855edcdd896b24a6ff7c93bc58464294666","last_reissued_at":"2026-05-18T00:31:02.181843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:02.181843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classes of graphs without star forests and related graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aistis Atminas","submitted_at":"2017-11-04T19:48:09Z","abstract_excerpt":"This work provides a structural characterisation of hereditary graph classes that do not contain a star forest, several graphs obtained from star forests by subset complementation, a union of cliques, and the complement of a union of cliques as induced subgraphs. This provides, for instance, structural results for graph classes not containing a matching and several complements of a matching. In terms of the speed of hereditary graph classes, our results imply that all such classes have at most factorial speed of growth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01483","kind":"arxiv","version":2},"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":"1711.01483","created_at":"2026-05-18T00:31:02.181952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01483v2","created_at":"2026-05-18T00:31:02.181952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01483","created_at":"2026-05-18T00:31:02.181952+00:00"},{"alias_kind":"pith_short_12","alias_value":"IE5EQAX6JMHX","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IE5EQAX6JMHXGHXB","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IE5EQAX6","created_at":"2026-05-18T12:31:21.493067+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/IE5EQAX6JMHXGHXB3W37HANYKX","json":"https://pith.science/pith/IE5EQAX6JMHXGHXB3W37HANYKX.json","graph_json":"https://pith.science/api/pith-number/IE5EQAX6JMHXGHXB3W37HANYKX/graph.json","events_json":"https://pith.science/api/pith-number/IE5EQAX6JMHXGHXB3W37HANYKX/events.json","paper":"https://pith.science/paper/IE5EQAX6"},"agent_actions":{"view_html":"https://pith.science/pith/IE5EQAX6JMHXGHXB3W37HANYKX","download_json":"https://pith.science/pith/IE5EQAX6JMHXGHXB3W37HANYKX.json","view_paper":"https://pith.science/paper/IE5EQAX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01483&json=true","fetch_graph":"https://pith.science/api/pith-number/IE5EQAX6JMHXGHXB3W37HANYKX/graph.json","fetch_events":"https://pith.science/api/pith-number/IE5EQAX6JMHXGHXB3W37HANYKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IE5EQAX6JMHXGHXB3W37HANYKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IE5EQAX6JMHXGHXB3W37HANYKX/action/storage_attestation","attest_author":"https://pith.science/pith/IE5EQAX6JMHXGHXB3W37HANYKX/action/author_attestation","sign_citation":"https://pith.science/pith/IE5EQAX6JMHXGHXB3W37HANYKX/action/citation_signature","submit_replication":"https://pith.science/pith/IE5EQAX6JMHXGHXB3W37HANYKX/action/replication_record"}},"created_at":"2026-05-18T00:31:02.181952+00:00","updated_at":"2026-05-18T00:31:02.181952+00:00"}