{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:42W3HDGPZJRTCARA7RZJJ43FJF","short_pith_number":"pith:42W3HDGP","schema_version":"1.0","canonical_sha256":"e6adb38ccfca63310220fc7294f3654951589e0b1746a9a23f2c3c0ac48bf81c","source":{"kind":"arxiv","id":"2007.00688","version":1},"attestation_state":"computed","paper":{"title":"Typical structure of hereditary graph families. II. Exotic examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Norin, Yelena Yuditsky","submitted_at":"2020-07-01T18:18:27Z","abstract_excerpt":"A graph $G$ is $H$-free if it does not contain an induced subgraph isomorphic to $H$. The study of the typical structure of $H$-free graphs was initiated by Erd\\H{o}s, Kleitman and Rothschild, who have shown that almost all $C_3$-free graphs are bipartite. Since then the typical structure of $H$-free graphs has been determined for several families of graphs $H$, including complete graphs, trees and cycles. Recently, Reed and Scott proposed a conjectural description of the typical structure of $H$-free graphs for all graphs $H$, which extends all previously known results in the area.\n  We const"},"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":"2007.00688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-01T18:18:27Z","cross_cats_sorted":[],"title_canon_sha256":"12d87a3db38a0f4f630b9dffddea77fe43fa60986b78c605c9268c796db0df01","abstract_canon_sha256":"adc62cc8d7968714f69534bfcf404210439380cae93b54ede255ea7d18e551e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:15:40.389639Z","signature_b64":"XrBio7H7CTHFOBALRnpbrO2HZieDs5ffwKqBwShuKljp4JWxcxYrMTu3uipwUV6No5/5R+1JLoc+fP5eZTQPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6adb38ccfca63310220fc7294f3654951589e0b1746a9a23f2c3c0ac48bf81c","last_reissued_at":"2026-07-05T01:15:40.389126Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:15:40.389126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Typical structure of hereditary graph families. II. Exotic examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Norin, Yelena Yuditsky","submitted_at":"2020-07-01T18:18:27Z","abstract_excerpt":"A graph $G$ is $H$-free if it does not contain an induced subgraph isomorphic to $H$. The study of the typical structure of $H$-free graphs was initiated by Erd\\H{o}s, Kleitman and Rothschild, who have shown that almost all $C_3$-free graphs are bipartite. Since then the typical structure of $H$-free graphs has been determined for several families of graphs $H$, including complete graphs, trees and cycles. Recently, Reed and Scott proposed a conjectural description of the typical structure of $H$-free graphs for all graphs $H$, which extends all previously known results in the area.\n  We const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00688","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.00688/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":"2007.00688","created_at":"2026-07-05T01:15:40.389188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.00688v1","created_at":"2026-07-05T01:15:40.389188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00688","created_at":"2026-07-05T01:15:40.389188+00:00"},{"alias_kind":"pith_short_12","alias_value":"42W3HDGPZJRT","created_at":"2026-07-05T01:15:40.389188+00:00"},{"alias_kind":"pith_short_16","alias_value":"42W3HDGPZJRTCARA","created_at":"2026-07-05T01:15:40.389188+00:00"},{"alias_kind":"pith_short_8","alias_value":"42W3HDGP","created_at":"2026-07-05T01:15:40.389188+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/42W3HDGPZJRTCARA7RZJJ43FJF","json":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF.json","graph_json":"https://pith.science/api/pith-number/42W3HDGPZJRTCARA7RZJJ43FJF/graph.json","events_json":"https://pith.science/api/pith-number/42W3HDGPZJRTCARA7RZJJ43FJF/events.json","paper":"https://pith.science/paper/42W3HDGP"},"agent_actions":{"view_html":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF","download_json":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF.json","view_paper":"https://pith.science/paper/42W3HDGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.00688&json=true","fetch_graph":"https://pith.science/api/pith-number/42W3HDGPZJRTCARA7RZJJ43FJF/graph.json","fetch_events":"https://pith.science/api/pith-number/42W3HDGPZJRTCARA7RZJJ43FJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF/action/storage_attestation","attest_author":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF/action/author_attestation","sign_citation":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF/action/citation_signature","submit_replication":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF/action/replication_record"}},"created_at":"2026-07-05T01:15:40.389188+00:00","updated_at":"2026-07-05T01:15:40.389188+00:00"}