{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:42W3HDGPZJRTCARA7RZJJ43FJF","short_pith_number":"pith:42W3HDGP","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"},"canonical_sha256":"e6adb38ccfca63310220fc7294f3654951589e0b1746a9a23f2c3c0ac48bf81c","source":{"kind":"arxiv","id":"2007.00688","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.00688","created_at":"2026-07-05T01:15:40Z"},{"alias_kind":"arxiv_version","alias_value":"2007.00688v1","created_at":"2026-07-05T01:15:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00688","created_at":"2026-07-05T01:15:40Z"},{"alias_kind":"pith_short_12","alias_value":"42W3HDGPZJRT","created_at":"2026-07-05T01:15:40Z"},{"alias_kind":"pith_short_16","alias_value":"42W3HDGPZJRTCARA","created_at":"2026-07-05T01:15:40Z"},{"alias_kind":"pith_short_8","alias_value":"42W3HDGP","created_at":"2026-07-05T01:15:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:42W3HDGPZJRTCARA7RZJJ43FJF","target":"record","payload":{"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"},"canonical_sha256":"e6adb38ccfca63310220fc7294f3654951589e0b1746a9a23f2c3c0ac48bf81c","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"},"source_kind":"arxiv","source_id":"2007.00688","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:15:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TVaNAMvqkP94D0eUwMAGyQLaNgfkSaardzWc8DRLQBre/fVPkXtpxQjZQXt1dmEF/GC5I96LLrkEu6ebjN3GAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:40:10.449844Z"},"content_sha256":"bc5a2dffdb7d901f98fe897934f17fb5ffeea707fa40ae5394dcbf958960bae5","schema_version":"1.0","event_id":"sha256:bc5a2dffdb7d901f98fe897934f17fb5ffeea707fa40ae5394dcbf958960bae5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:42W3HDGPZJRTCARA7RZJJ43FJF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:15:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdXHWNKXtmMb4dTmpQeSlbw+N/ntOzCxBDgQmm92NprMb+Ruu2X0yKGTX0Jdqr8CHC1iJaxIpvc5/VGPf9AzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:40:10.450355Z"},"content_sha256":"8618628983d65c7f3f4885f191b8769603cb2c8cfd6d961108b29674fe3dd9d9","schema_version":"1.0","event_id":"sha256:8618628983d65c7f3f4885f191b8769603cb2c8cfd6d961108b29674fe3dd9d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF/bundle.json","state_url":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42W3HDGPZJRTCARA7RZJJ43FJF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T23:40:10Z","links":{"resolver":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF","bundle":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF/bundle.json","state":"https://pith.science/pith/42W3HDGPZJRTCARA7RZJJ43FJF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42W3HDGPZJRTCARA7RZJJ43FJF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:42W3HDGPZJRTCARA7RZJJ43FJF","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":"adc62cc8d7968714f69534bfcf404210439380cae93b54ede255ea7d18e551e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-01T18:18:27Z","title_canon_sha256":"12d87a3db38a0f4f630b9dffddea77fe43fa60986b78c605c9268c796db0df01"},"schema_version":"1.0","source":{"id":"2007.00688","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.00688","created_at":"2026-07-05T01:15:40Z"},{"alias_kind":"arxiv_version","alias_value":"2007.00688v1","created_at":"2026-07-05T01:15:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00688","created_at":"2026-07-05T01:15:40Z"},{"alias_kind":"pith_short_12","alias_value":"42W3HDGPZJRT","created_at":"2026-07-05T01:15:40Z"},{"alias_kind":"pith_short_16","alias_value":"42W3HDGPZJRTCARA","created_at":"2026-07-05T01:15:40Z"},{"alias_kind":"pith_short_8","alias_value":"42W3HDGP","created_at":"2026-07-05T01:15:40Z"}],"graph_snapshots":[{"event_id":"sha256:8618628983d65c7f3f4885f191b8769603cb2c8cfd6d961108b29674fe3dd9d9","target":"graph","created_at":"2026-07-05T01:15:40Z","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/2007.00688/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Sergey Norin, Yelena Yuditsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-01T18:18:27Z","title":"Typical structure of hereditary graph families. II. Exotic examples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00688","kind":"arxiv","version":1},"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:bc5a2dffdb7d901f98fe897934f17fb5ffeea707fa40ae5394dcbf958960bae5","target":"record","created_at":"2026-07-05T01:15:40Z","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":"adc62cc8d7968714f69534bfcf404210439380cae93b54ede255ea7d18e551e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-01T18:18:27Z","title_canon_sha256":"12d87a3db38a0f4f630b9dffddea77fe43fa60986b78c605c9268c796db0df01"},"schema_version":"1.0","source":{"id":"2007.00688","kind":"arxiv","version":1}},"canonical_sha256":"e6adb38ccfca63310220fc7294f3654951589e0b1746a9a23f2c3c0ac48bf81c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6adb38ccfca63310220fc7294f3654951589e0b1746a9a23f2c3c0ac48bf81c","first_computed_at":"2026-07-05T01:15:40.389126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:15:40.389126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XrBio7H7CTHFOBALRnpbrO2HZieDs5ffwKqBwShuKljp4JWxcxYrMTu3uipwUV6No5/5R+1JLoc+fP5eZTQPCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:15:40.389639Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.00688","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc5a2dffdb7d901f98fe897934f17fb5ffeea707fa40ae5394dcbf958960bae5","sha256:8618628983d65c7f3f4885f191b8769603cb2c8cfd6d961108b29674fe3dd9d9"],"state_sha256":"37c5e2c5b5bacbdd65732dcfa64d4591018aa7829642fd696341966123e56bb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XuWEwr4bz1vZiXfWgwDCGyarRHI7irG5WCKx1arXGLbpSZd2BcrimPQvwwFbVoM6Y8VM6UwB+2ZVLRBRFbvwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T23:40:10.483728Z","bundle_sha256":"bcb8a306b003533755fb3d703e799f9cc4951b15448c9e2983434c3b6d831727"}}