{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WACC2BOCQ52NLHJEI3RQTV7QMT","short_pith_number":"pith:WACC2BOC","canonical_record":{"source":{"id":"1710.04517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-12T13:42:25Z","cross_cats_sorted":[],"title_canon_sha256":"bb548940866dc1341e7787afa82eb3850da9ee2c041218669c6fc587ef07095a","abstract_canon_sha256":"addf1724f1deee5d4e185064ef127cd1eba05876fc929dde1711552e0825a43d"},"schema_version":"1.0"},"canonical_sha256":"b0042d05c28774d59d2446e309d7f064f6b7448ee6e7efd6a52135044a75254f","source":{"kind":"arxiv","id":"1710.04517","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04517","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04517v1","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04517","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"WACC2BOCQ52N","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WACC2BOCQ52NLHJE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WACC2BOC","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WACC2BOCQ52NLHJEI3RQTV7QMT","target":"record","payload":{"canonical_record":{"source":{"id":"1710.04517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-12T13:42:25Z","cross_cats_sorted":[],"title_canon_sha256":"bb548940866dc1341e7787afa82eb3850da9ee2c041218669c6fc587ef07095a","abstract_canon_sha256":"addf1724f1deee5d4e185064ef127cd1eba05876fc929dde1711552e0825a43d"},"schema_version":"1.0"},"canonical_sha256":"b0042d05c28774d59d2446e309d7f064f6b7448ee6e7efd6a52135044a75254f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:00.780175Z","signature_b64":"2tSYZKJjwnbXNOpCUMGuMwftBYNi3PkJYuIi7se0R9V0Sk0dJGmZstlXtL78COrIvhXEHLpnzS+znjltavTbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0042d05c28774d59d2446e309d7f064f6b7448ee6e7efd6a52135044a75254f","last_reissued_at":"2026-05-18T00:33:00.779638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:00.779638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.04517","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-05-18T00:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1Wa7mCtMnEPpfIehKbb0SSkQD0AylUdSsq8k0KTGVPx6DLJqYs8MV8bZtTWPzBWdqX5b5soB9t9B+MwLL1/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:53:03.205662Z"},"content_sha256":"83d5f0333305cf564b1100a477c67a9a517294bd23dd9866e1c1fb815fbd9ca8","schema_version":"1.0","event_id":"sha256:83d5f0333305cf564b1100a477c67a9a517294bd23dd9866e1c1fb815fbd9ca8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WACC2BOCQ52NLHJEI3RQTV7QMT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supersaturated sparse graphs and hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Gweneth Anne McKinley, Wojciech Samotij","submitted_at":"2017-10-12T13:42:25Z","abstract_excerpt":"A central problem in extremal graph theory is to estimate, for a given graph $H$, the number of $H$-free graphs on a given set of $n$ vertices. In the case when $H$ is not bipartite, fairly precise estimates on this number are known. In particular, thirty years ago, Erd\\H{o}s, Frankl, and R\\\"odl proved that there are $2^{(1+o(1))\\text{ex}(n,H)}$ such graphs. In the bipartite case, however, nontrivial bounds have been proven only for relatively few special graphs $H$.\n  We make a first attempt at addressing this enumeration problem for a general bipartite graph $H$. We show that an upper bound "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04517","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"},"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-05-18T00:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJGQjKnrSX81SPwPABAKtklIhowN2Jdo9Qd7g65PSKRfLqp5rjuM0v7SsO6zPuXCdqSw1/z5kLADJxbgkrQxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:53:03.206374Z"},"content_sha256":"b4400d8235b705d9e2e8929fddc71f76446e0165f66280dc39b2ee58f744bc09","schema_version":"1.0","event_id":"sha256:b4400d8235b705d9e2e8929fddc71f76446e0165f66280dc39b2ee58f744bc09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WACC2BOCQ52NLHJEI3RQTV7QMT/bundle.json","state_url":"https://pith.science/pith/WACC2BOCQ52NLHJEI3RQTV7QMT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WACC2BOCQ52NLHJEI3RQTV7QMT/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-06-08T05:53:03Z","links":{"resolver":"https://pith.science/pith/WACC2BOCQ52NLHJEI3RQTV7QMT","bundle":"https://pith.science/pith/WACC2BOCQ52NLHJEI3RQTV7QMT/bundle.json","state":"https://pith.science/pith/WACC2BOCQ52NLHJEI3RQTV7QMT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WACC2BOCQ52NLHJEI3RQTV7QMT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WACC2BOCQ52NLHJEI3RQTV7QMT","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":"addf1724f1deee5d4e185064ef127cd1eba05876fc929dde1711552e0825a43d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-12T13:42:25Z","title_canon_sha256":"bb548940866dc1341e7787afa82eb3850da9ee2c041218669c6fc587ef07095a"},"schema_version":"1.0","source":{"id":"1710.04517","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04517","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04517v1","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04517","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"WACC2BOCQ52N","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WACC2BOCQ52NLHJE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WACC2BOC","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:b4400d8235b705d9e2e8929fddc71f76446e0165f66280dc39b2ee58f744bc09","target":"graph","created_at":"2026-05-18T00:33:00Z","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"},"paper":{"abstract_excerpt":"A central problem in extremal graph theory is to estimate, for a given graph $H$, the number of $H$-free graphs on a given set of $n$ vertices. In the case when $H$ is not bipartite, fairly precise estimates on this number are known. In particular, thirty years ago, Erd\\H{o}s, Frankl, and R\\\"odl proved that there are $2^{(1+o(1))\\text{ex}(n,H)}$ such graphs. In the bipartite case, however, nontrivial bounds have been proven only for relatively few special graphs $H$.\n  We make a first attempt at addressing this enumeration problem for a general bipartite graph $H$. We show that an upper bound ","authors_text":"Asaf Ferber, Gweneth Anne McKinley, Wojciech Samotij","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-12T13:42:25Z","title":"Supersaturated sparse graphs and hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04517","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:83d5f0333305cf564b1100a477c67a9a517294bd23dd9866e1c1fb815fbd9ca8","target":"record","created_at":"2026-05-18T00:33:00Z","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":"addf1724f1deee5d4e185064ef127cd1eba05876fc929dde1711552e0825a43d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-12T13:42:25Z","title_canon_sha256":"bb548940866dc1341e7787afa82eb3850da9ee2c041218669c6fc587ef07095a"},"schema_version":"1.0","source":{"id":"1710.04517","kind":"arxiv","version":1}},"canonical_sha256":"b0042d05c28774d59d2446e309d7f064f6b7448ee6e7efd6a52135044a75254f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0042d05c28774d59d2446e309d7f064f6b7448ee6e7efd6a52135044a75254f","first_computed_at":"2026-05-18T00:33:00.779638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:00.779638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2tSYZKJjwnbXNOpCUMGuMwftBYNi3PkJYuIi7se0R9V0Sk0dJGmZstlXtL78COrIvhXEHLpnzS+znjltavTbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:00.780175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04517","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83d5f0333305cf564b1100a477c67a9a517294bd23dd9866e1c1fb815fbd9ca8","sha256:b4400d8235b705d9e2e8929fddc71f76446e0165f66280dc39b2ee58f744bc09"],"state_sha256":"aceb53355077b04caac548f1cb93ba355938dc758b3f2529484244acc5a698b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8Kz0zfJ4zk6PwCN9htU435K4eFCAcPwRBQ2uoQTx4VvsRBd+B+8dQ430iA2Tg2NuSfglvxat+jrA7uM7NanBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:53:03.210626Z","bundle_sha256":"e4dc282ec2aa746f9dbaab7c74d402ff1af01c99a25222ba96410c3ad07dcdc0"}}