{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2Q34SQAD3NTEW3K4TK5GIIGKB6","short_pith_number":"pith:2Q34SQAD","canonical_record":{"source":{"id":"1606.01043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-03T10:59:07Z","cross_cats_sorted":[],"title_canon_sha256":"633a5dd7b7792f6ca49ee721a916f8d3577e696bb09e9aee5bc3b20af654cca5","abstract_canon_sha256":"8e965d05f9f309ace0380a2ca3371dd97ddfe602e3a688deff258291a4c43a19"},"schema_version":"1.0"},"canonical_sha256":"d437c94003db664b6d5c9aba6420ca0f9637440dadeb17961ce352058ccb71fd","source":{"kind":"arxiv","id":"1606.01043","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01043","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01043v2","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01043","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"2Q34SQAD3NTE","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2Q34SQAD3NTEW3K4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2Q34SQAD","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2Q34SQAD3NTEW3K4TK5GIIGKB6","target":"record","payload":{"canonical_record":{"source":{"id":"1606.01043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-03T10:59:07Z","cross_cats_sorted":[],"title_canon_sha256":"633a5dd7b7792f6ca49ee721a916f8d3577e696bb09e9aee5bc3b20af654cca5","abstract_canon_sha256":"8e965d05f9f309ace0380a2ca3371dd97ddfe602e3a688deff258291a4c43a19"},"schema_version":"1.0"},"canonical_sha256":"d437c94003db664b6d5c9aba6420ca0f9637440dadeb17961ce352058ccb71fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:11.987309Z","signature_b64":"1Kp6n+vIo0YPZ114KmSfJoxDJDGyZfs0nr0wRYQjgeT5bFNwjvHx3UUrkrLenv3yN4gvpctvL1NkkIaUQxMWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d437c94003db664b6d5c9aba6420ca0f9637440dadeb17961ce352058ccb71fd","last_reissued_at":"2026-05-18T00:25:11.986937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:11.986937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.01043","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-18T00:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWBwzCgnMauNI0x1dBnE2Bgy/D2bEj00xvKprpHcarqdFxarVVlzvYNNgpBUZU5lkbEZqejdGNS53Bp+Bg8NCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:11.128266Z"},"content_sha256":"6886be789e971669f33b9776ff1c3461dae7a406c0b72bd9120cf1618e083f6a","schema_version":"1.0","event_id":"sha256:6886be789e971669f33b9776ff1c3461dae7a406c0b72bd9120cf1618e083f6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2Q34SQAD3NTEW3K4TK5GIIGKB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the average size of independent sets in triangle-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barnaby Roberts, Ewan Davies, Matthew Jenssen, Will Perkins","submitted_at":"2016-06-03T10:59:07Z","abstract_excerpt":"We prove an asymptotically tight lower bound on the average size of independent sets in a triangle-free graph on $n$ vertices with maximum degree $d$, showing that an independent set drawn uniformly at random from such a graph has expected size at least $(1+o_d(1)) \\frac{\\log d}{d}n$. This gives an alternative proof of Shearer's upper bound on the Ramsey number $R(3,k)$. We then prove that the total number of independent sets in a triangle-free graph with maximum degree $d$ is at least $\\exp \\left[\\left(\\frac{1}{2}+o_d(1) \\right) \\frac{\\log^2 d}{d}n \\right]$. The constant $1/2$ in the exponent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01043","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-18T00:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D7qYvvIRXB/s+fT9WwqmA6LFIMx+i/7qQInVbnRxOXNo0SJW2KXfTWWXjntWBt3RRWmi8ouXnlAMga+K7TLFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:11.128631Z"},"content_sha256":"2e4e9f188caad6c56e407f9a37ec145efffd6f2d3c6ef4432b6362f2937165e4","schema_version":"1.0","event_id":"sha256:2e4e9f188caad6c56e407f9a37ec145efffd6f2d3c6ef4432b6362f2937165e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2Q34SQAD3NTEW3K4TK5GIIGKB6/bundle.json","state_url":"https://pith.science/pith/2Q34SQAD3NTEW3K4TK5GIIGKB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2Q34SQAD3NTEW3K4TK5GIIGKB6/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-05-30T09:21:11Z","links":{"resolver":"https://pith.science/pith/2Q34SQAD3NTEW3K4TK5GIIGKB6","bundle":"https://pith.science/pith/2Q34SQAD3NTEW3K4TK5GIIGKB6/bundle.json","state":"https://pith.science/pith/2Q34SQAD3NTEW3K4TK5GIIGKB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2Q34SQAD3NTEW3K4TK5GIIGKB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2Q34SQAD3NTEW3K4TK5GIIGKB6","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":"8e965d05f9f309ace0380a2ca3371dd97ddfe602e3a688deff258291a4c43a19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-03T10:59:07Z","title_canon_sha256":"633a5dd7b7792f6ca49ee721a916f8d3577e696bb09e9aee5bc3b20af654cca5"},"schema_version":"1.0","source":{"id":"1606.01043","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01043","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01043v2","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01043","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"2Q34SQAD3NTE","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2Q34SQAD3NTEW3K4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2Q34SQAD","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:2e4e9f188caad6c56e407f9a37ec145efffd6f2d3c6ef4432b6362f2937165e4","target":"graph","created_at":"2026-05-18T00:25:11Z","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":"We prove an asymptotically tight lower bound on the average size of independent sets in a triangle-free graph on $n$ vertices with maximum degree $d$, showing that an independent set drawn uniformly at random from such a graph has expected size at least $(1+o_d(1)) \\frac{\\log d}{d}n$. This gives an alternative proof of Shearer's upper bound on the Ramsey number $R(3,k)$. We then prove that the total number of independent sets in a triangle-free graph with maximum degree $d$ is at least $\\exp \\left[\\left(\\frac{1}{2}+o_d(1) \\right) \\frac{\\log^2 d}{d}n \\right]$. The constant $1/2$ in the exponent","authors_text":"Barnaby Roberts, Ewan Davies, Matthew Jenssen, Will Perkins","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-03T10:59:07Z","title":"On the average size of independent sets in triangle-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01043","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:6886be789e971669f33b9776ff1c3461dae7a406c0b72bd9120cf1618e083f6a","target":"record","created_at":"2026-05-18T00:25:11Z","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":"8e965d05f9f309ace0380a2ca3371dd97ddfe602e3a688deff258291a4c43a19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-03T10:59:07Z","title_canon_sha256":"633a5dd7b7792f6ca49ee721a916f8d3577e696bb09e9aee5bc3b20af654cca5"},"schema_version":"1.0","source":{"id":"1606.01043","kind":"arxiv","version":2}},"canonical_sha256":"d437c94003db664b6d5c9aba6420ca0f9637440dadeb17961ce352058ccb71fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d437c94003db664b6d5c9aba6420ca0f9637440dadeb17961ce352058ccb71fd","first_computed_at":"2026-05-18T00:25:11.986937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:11.986937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Kp6n+vIo0YPZ114KmSfJoxDJDGyZfs0nr0wRYQjgeT5bFNwjvHx3UUrkrLenv3yN4gvpctvL1NkkIaUQxMWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:11.987309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.01043","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6886be789e971669f33b9776ff1c3461dae7a406c0b72bd9120cf1618e083f6a","sha256:2e4e9f188caad6c56e407f9a37ec145efffd6f2d3c6ef4432b6362f2937165e4"],"state_sha256":"8f70e94614d8c5e976c9bf4246b8ed8cb0dcc308966728e35a7a09a6b9333bd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BNOoVCeoeQGNf8phy0DFKz6x+4TSJ3ERs/sGTq8ZOT9xgvNlPB7+eCuizGHmUbXdWB+eLhSIQWCCyiFXKoXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:21:11.130956Z","bundle_sha256":"faf869d1c727235736420d1f822923c4a819f58c38b0cea1ee580f14769c18d2"}}