{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4AZ2N2ZA7N5HXCEYG4O5PYSEON","short_pith_number":"pith:4AZ2N2ZA","schema_version":"1.0","canonical_sha256":"e033a6eb20fb7a7b8898371dd7e244734fa845e0c51a5d094c33a6cefa9fc793","source":{"kind":"arxiv","id":"1107.1121","version":1},"attestation_state":"computed","paper":{"title":"Some new results in extremal graph theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Nikiforov","submitted_at":"2011-07-06T13:05:09Z","abstract_excerpt":"In recent years several classical results in extremal graph theory have been improved in a uniform way and their proofs have been simplified and streamlined. These results include a new Erd\\H{o}s-Stone-Bollob\\'as theorem, several stability theorems, several saturation results and bounds for the number of graphs with large forbidden subgraphs. Another recent trend is the expansion of spectral extremal graph theory, in which extremal properties of graphs are studied by means of eigenvalues of various matrices. One particular achievement in this area is the casting of the central results above in"},"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":"1107.1121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-06T13:05:09Z","cross_cats_sorted":[],"title_canon_sha256":"b49533eb4fa7b4fc8ae5a0aec2380617b2a111016a08c4273ee908bb863f9d04","abstract_canon_sha256":"5e0dc62e4ef57b76e7a53fcce27b1d433713433d0d3cab572a223f2c807fa892"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:45.556959Z","signature_b64":"0SJS13y3qVbzWHfAxX7T4qnZJMsUw3q83OEuylnx2ND1vwz8UNn9Q6Bu0drVeH2zljcZxUNvs43fB6VePbWrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e033a6eb20fb7a7b8898371dd7e244734fa845e0c51a5d094c33a6cefa9fc793","last_reissued_at":"2026-05-18T04:18:45.556411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:45.556411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some new results in extremal graph theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Nikiforov","submitted_at":"2011-07-06T13:05:09Z","abstract_excerpt":"In recent years several classical results in extremal graph theory have been improved in a uniform way and their proofs have been simplified and streamlined. These results include a new Erd\\H{o}s-Stone-Bollob\\'as theorem, several stability theorems, several saturation results and bounds for the number of graphs with large forbidden subgraphs. Another recent trend is the expansion of spectral extremal graph theory, in which extremal properties of graphs are studied by means of eigenvalues of various matrices. One particular achievement in this area is the casting of the central results above in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1121","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.1121","created_at":"2026-05-18T04:18:45.556516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1121v1","created_at":"2026-05-18T04:18:45.556516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1121","created_at":"2026-05-18T04:18:45.556516+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AZ2N2ZA7N5H","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AZ2N2ZA7N5HXCEY","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AZ2N2ZA","created_at":"2026-05-18T12:26:20.644004+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/4AZ2N2ZA7N5HXCEYG4O5PYSEON","json":"https://pith.science/pith/4AZ2N2ZA7N5HXCEYG4O5PYSEON.json","graph_json":"https://pith.science/api/pith-number/4AZ2N2ZA7N5HXCEYG4O5PYSEON/graph.json","events_json":"https://pith.science/api/pith-number/4AZ2N2ZA7N5HXCEYG4O5PYSEON/events.json","paper":"https://pith.science/paper/4AZ2N2ZA"},"agent_actions":{"view_html":"https://pith.science/pith/4AZ2N2ZA7N5HXCEYG4O5PYSEON","download_json":"https://pith.science/pith/4AZ2N2ZA7N5HXCEYG4O5PYSEON.json","view_paper":"https://pith.science/paper/4AZ2N2ZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1121&json=true","fetch_graph":"https://pith.science/api/pith-number/4AZ2N2ZA7N5HXCEYG4O5PYSEON/graph.json","fetch_events":"https://pith.science/api/pith-number/4AZ2N2ZA7N5HXCEYG4O5PYSEON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AZ2N2ZA7N5HXCEYG4O5PYSEON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AZ2N2ZA7N5HXCEYG4O5PYSEON/action/storage_attestation","attest_author":"https://pith.science/pith/4AZ2N2ZA7N5HXCEYG4O5PYSEON/action/author_attestation","sign_citation":"https://pith.science/pith/4AZ2N2ZA7N5HXCEYG4O5PYSEON/action/citation_signature","submit_replication":"https://pith.science/pith/4AZ2N2ZA7N5HXCEYG4O5PYSEON/action/replication_record"}},"created_at":"2026-05-18T04:18:45.556516+00:00","updated_at":"2026-05-18T04:18:45.556516+00:00"}