{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IH4MHYPGM2MUDHUJ2AFLLW724R","short_pith_number":"pith:IH4MHYPG","schema_version":"1.0","canonical_sha256":"41f8c3e1e66699419e89d00ab5dbfae46c22d309b3c7d66631521f16d799c836","source":{"kind":"arxiv","id":"1305.1073","version":2},"attestation_state":"computed","paper":{"title":"An analytic theory of extremal hypergraph problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Nikiforov","submitted_at":"2013-05-06T02:50:19Z","abstract_excerpt":"In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently introduced graph parameter. The paper builds a basis for the systematic study of this parameter and illustrates a range of various proof tools. It is shown that extremal problems about the number of edges of uniform hypergraphs are asymptotically equivalent to extremal problems about the largest eigenvalue; this result is new even for 2-graphs. Several concrete prob"},"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":"1305.1073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-06T02:50:19Z","cross_cats_sorted":[],"title_canon_sha256":"d57b87acab7c0b9c276a2f54a651b29322dc279b0b9c7cf78f22c1b8e3aed11d","abstract_canon_sha256":"256e7962e869094f63746f3e00f36c2f75b70b7ef487085b09787d09d00e35d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:58.038725Z","signature_b64":"BbNbFdMRqaoUh542exIiNO6BgzXlp4J/Cen8pbCRwp2M1BLyP2O0dcaibaAined9P8gspjDhg90/muzaJkzZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41f8c3e1e66699419e89d00ab5dbfae46c22d309b3c7d66631521f16d799c836","last_reissued_at":"2026-05-18T03:25:58.038139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:58.038139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An analytic theory of extremal hypergraph problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Nikiforov","submitted_at":"2013-05-06T02:50:19Z","abstract_excerpt":"In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently introduced graph parameter. The paper builds a basis for the systematic study of this parameter and illustrates a range of various proof tools. It is shown that extremal problems about the number of edges of uniform hypergraphs are asymptotically equivalent to extremal problems about the largest eigenvalue; this result is new even for 2-graphs. Several concrete prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1073","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.1073","created_at":"2026-05-18T03:25:58.038221+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1073v2","created_at":"2026-05-18T03:25:58.038221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1073","created_at":"2026-05-18T03:25:58.038221+00:00"},{"alias_kind":"pith_short_12","alias_value":"IH4MHYPGM2MU","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IH4MHYPGM2MUDHUJ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IH4MHYPG","created_at":"2026-05-18T12:27:46.883200+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/IH4MHYPGM2MUDHUJ2AFLLW724R","json":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R.json","graph_json":"https://pith.science/api/pith-number/IH4MHYPGM2MUDHUJ2AFLLW724R/graph.json","events_json":"https://pith.science/api/pith-number/IH4MHYPGM2MUDHUJ2AFLLW724R/events.json","paper":"https://pith.science/paper/IH4MHYPG"},"agent_actions":{"view_html":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R","download_json":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R.json","view_paper":"https://pith.science/paper/IH4MHYPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1073&json=true","fetch_graph":"https://pith.science/api/pith-number/IH4MHYPGM2MUDHUJ2AFLLW724R/graph.json","fetch_events":"https://pith.science/api/pith-number/IH4MHYPGM2MUDHUJ2AFLLW724R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R/action/storage_attestation","attest_author":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R/action/author_attestation","sign_citation":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R/action/citation_signature","submit_replication":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R/action/replication_record"}},"created_at":"2026-05-18T03:25:58.038221+00:00","updated_at":"2026-05-18T03:25:58.038221+00:00"}