{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HMUMTAJJTAZXBMULBDUECNESB6","short_pith_number":"pith:HMUMTAJJ","canonical_record":{"source":{"id":"1502.02602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-09T19:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"00032f703fbda7d46b7fb9beb52672a692441b4bd7955ef9eacdb52c425d2a99","abstract_canon_sha256":"e495a03fff5d4fe70b6bd69288c014213bf382e441731d44543ea294d8487399"},"schema_version":"1.0"},"canonical_sha256":"3b28c98129983370b28b08e84134920f8c5df9cdeeb10f9c2c229c0052a67258","source":{"kind":"arxiv","id":"1502.02602","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02602","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02602v2","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02602","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"pith_short_12","alias_value":"HMUMTAJJTAZX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HMUMTAJJTAZXBMUL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HMUMTAJJ","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HMUMTAJJTAZXBMULBDUECNESB6","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-09T19:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"00032f703fbda7d46b7fb9beb52672a692441b4bd7955ef9eacdb52c425d2a99","abstract_canon_sha256":"e495a03fff5d4fe70b6bd69288c014213bf382e441731d44543ea294d8487399"},"schema_version":"1.0"},"canonical_sha256":"3b28c98129983370b28b08e84134920f8c5df9cdeeb10f9c2c229c0052a67258","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:20.626289Z","signature_b64":"4n423DBmH704Rnam9Mur6vkKHXK81rIUmtmPtnuJVSFW3/N1p+FEtXRKFZtVS/IflwyCmmGDtHGaDqPEr4Q6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b28c98129983370b28b08e84134920f8c5df9cdeeb10f9c2c229c0052a67258","last_reissued_at":"2026-05-18T02:27:20.625638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:20.625638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02602","source_version":2,"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-18T02:27:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJAiSE6z5wZ6tQFlgBdeu+NWQK7kAv1078orXW+f/FTM31meW1an/TKa4n/TH9R4koQJ2dLrHDLpMofqUagMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:54:53.922087Z"},"content_sha256":"bd8df4e3912fc6664fb444165cb4e68edec90b8620688783098b41dd689a6cfb","schema_version":"1.0","event_id":"sha256:bd8df4e3912fc6664fb444165cb4e68edec90b8620688783098b41dd689a6cfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HMUMTAJJTAZXBMULBDUECNESB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Small dense subgraphs of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Newman, Tao Jiang","submitted_at":"2015-02-09T19:00:22Z","abstract_excerpt":"Given a family ${\\cal F}$ of graphs, and a positive integer $n$, the Tur\\'an number $ex(n,{\\cal F})$ of ${\\cal F}$ is the maximum number of edges in an $n$-vertex graph that does not contain any member of ${\\cal F}$ as a subgraph. The order of a graph is the number of vertices in it. In this paper, we study the Tur\\'an number of the family of graphs with bounded order and high average degree. For every real $d\\geq 2$ and positive integer $m\\geq 2$, let ${\\cal F}_{d,m}$ denote the family of graphs on at most $m$ vertices that have average degree at least $d$. It follows from the Erd\\H{o}s-R\\'en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02602","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"},"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-18T02:27:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hU5Bk8EPNr82V6zuYJE0LwWQNMpdN2a/+JB5JNG1o8YhJmKRePWC3oFOYMR8gClhcWtgJPWizCD4whZnGpq3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:54:53.922451Z"},"content_sha256":"068fa4313cf7e12e75c1174ec081ea6cf6355d8ac8fd66445aa98e90fd8989ce","schema_version":"1.0","event_id":"sha256:068fa4313cf7e12e75c1174ec081ea6cf6355d8ac8fd66445aa98e90fd8989ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMUMTAJJTAZXBMULBDUECNESB6/bundle.json","state_url":"https://pith.science/pith/HMUMTAJJTAZXBMULBDUECNESB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMUMTAJJTAZXBMULBDUECNESB6/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-01T12:54:53Z","links":{"resolver":"https://pith.science/pith/HMUMTAJJTAZXBMULBDUECNESB6","bundle":"https://pith.science/pith/HMUMTAJJTAZXBMULBDUECNESB6/bundle.json","state":"https://pith.science/pith/HMUMTAJJTAZXBMULBDUECNESB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMUMTAJJTAZXBMULBDUECNESB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HMUMTAJJTAZXBMULBDUECNESB6","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":"e495a03fff5d4fe70b6bd69288c014213bf382e441731d44543ea294d8487399","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-09T19:00:22Z","title_canon_sha256":"00032f703fbda7d46b7fb9beb52672a692441b4bd7955ef9eacdb52c425d2a99"},"schema_version":"1.0","source":{"id":"1502.02602","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02602","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02602v2","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02602","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"pith_short_12","alias_value":"HMUMTAJJTAZX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HMUMTAJJTAZXBMUL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HMUMTAJJ","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:068fa4313cf7e12e75c1174ec081ea6cf6355d8ac8fd66445aa98e90fd8989ce","target":"graph","created_at":"2026-05-18T02:27:20Z","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":"Given a family ${\\cal F}$ of graphs, and a positive integer $n$, the Tur\\'an number $ex(n,{\\cal F})$ of ${\\cal F}$ is the maximum number of edges in an $n$-vertex graph that does not contain any member of ${\\cal F}$ as a subgraph. The order of a graph is the number of vertices in it. In this paper, we study the Tur\\'an number of the family of graphs with bounded order and high average degree. For every real $d\\geq 2$ and positive integer $m\\geq 2$, let ${\\cal F}_{d,m}$ denote the family of graphs on at most $m$ vertices that have average degree at least $d$. It follows from the Erd\\H{o}s-R\\'en","authors_text":"Andrew Newman, Tao Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-09T19:00:22Z","title":"Small dense subgraphs of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02602","kind":"arxiv","version":2},"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:bd8df4e3912fc6664fb444165cb4e68edec90b8620688783098b41dd689a6cfb","target":"record","created_at":"2026-05-18T02:27:20Z","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":"e495a03fff5d4fe70b6bd69288c014213bf382e441731d44543ea294d8487399","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-09T19:00:22Z","title_canon_sha256":"00032f703fbda7d46b7fb9beb52672a692441b4bd7955ef9eacdb52c425d2a99"},"schema_version":"1.0","source":{"id":"1502.02602","kind":"arxiv","version":2}},"canonical_sha256":"3b28c98129983370b28b08e84134920f8c5df9cdeeb10f9c2c229c0052a67258","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b28c98129983370b28b08e84134920f8c5df9cdeeb10f9c2c229c0052a67258","first_computed_at":"2026-05-18T02:27:20.625638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:20.625638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4n423DBmH704Rnam9Mur6vkKHXK81rIUmtmPtnuJVSFW3/N1p+FEtXRKFZtVS/IflwyCmmGDtHGaDqPEr4Q6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:20.626289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02602","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd8df4e3912fc6664fb444165cb4e68edec90b8620688783098b41dd689a6cfb","sha256:068fa4313cf7e12e75c1174ec081ea6cf6355d8ac8fd66445aa98e90fd8989ce"],"state_sha256":"1573cebcaffc6d83b7360a5b90dc16dcee54cd6fc5f32442f1bd2ea84049c3b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSV7Gi398/gRJGXWHHti0srb/kcWP7d4YP4NR2p/0IktkMfJhCzdL+yF2ILtxvgfBySwkv1FmJI6Zzl4/IUPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:54:53.924474Z","bundle_sha256":"2b9b7b42615f5e1f9e22134cb9d98845b429ecb566b861024a4b82728d287899"}}