{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IH4MHYPGM2MUDHUJ2AFLLW724R","short_pith_number":"pith:IH4MHYPG","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"},"canonical_sha256":"41f8c3e1e66699419e89d00ab5dbfae46c22d309b3c7d66631521f16d799c836","source":{"kind":"arxiv","id":"1305.1073","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1073","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1073v2","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1073","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"pith_short_12","alias_value":"IH4MHYPGM2MU","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IH4MHYPGM2MUDHUJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IH4MHYPG","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IH4MHYPGM2MUDHUJ2AFLLW724R","target":"record","payload":{"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"},"canonical_sha256":"41f8c3e1e66699419e89d00ab5dbfae46c22d309b3c7d66631521f16d799c836","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"},"source_kind":"arxiv","source_id":"1305.1073","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-18T03:25:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XT7is1qvUOR2VrNWPWaxtcj3gGLzxgGtOASuNltDw5sY1jam2zLTiKiW8dGr9YGVSpk5WeyXXIULUEvt0BcICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:16:12.075846Z"},"content_sha256":"d466dace308c50a7375d913ca43af59afd34f81a2b546f20109ead33bcb8e758","schema_version":"1.0","event_id":"sha256:d466dace308c50a7375d913ca43af59afd34f81a2b546f20109ead33bcb8e758"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IH4MHYPGM2MUDHUJ2AFLLW724R","target":"graph","payload":{"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"},"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-18T03:25:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N6av4zeGVv8G3Z1myPpBa3k0CTbpCkvBdbMvfPnsx4GzWXUvWwByjUwBC+yF5GNKpe5t8eZqRqcAp6cQTYQfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:16:12.076554Z"},"content_sha256":"ca317df5ef7e2e2ea1a54939c4184f9c0d23772f997b077206147f1dbf915b4e","schema_version":"1.0","event_id":"sha256:ca317df5ef7e2e2ea1a54939c4184f9c0d23772f997b077206147f1dbf915b4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R/bundle.json","state_url":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IH4MHYPGM2MUDHUJ2AFLLW724R/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-24T12:16:12Z","links":{"resolver":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R","bundle":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R/bundle.json","state":"https://pith.science/pith/IH4MHYPGM2MUDHUJ2AFLLW724R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IH4MHYPGM2MUDHUJ2AFLLW724R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IH4MHYPGM2MUDHUJ2AFLLW724R","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":"256e7962e869094f63746f3e00f36c2f75b70b7ef487085b09787d09d00e35d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-06T02:50:19Z","title_canon_sha256":"d57b87acab7c0b9c276a2f54a651b29322dc279b0b9c7cf78f22c1b8e3aed11d"},"schema_version":"1.0","source":{"id":"1305.1073","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1073","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1073v2","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1073","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"pith_short_12","alias_value":"IH4MHYPGM2MU","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IH4MHYPGM2MUDHUJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IH4MHYPG","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ca317df5ef7e2e2ea1a54939c4184f9c0d23772f997b077206147f1dbf915b4e","target":"graph","created_at":"2026-05-18T03:25:58Z","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":"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","authors_text":"Vladimir Nikiforov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-06T02:50:19Z","title":"An analytic theory of extremal hypergraph problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1073","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:d466dace308c50a7375d913ca43af59afd34f81a2b546f20109ead33bcb8e758","target":"record","created_at":"2026-05-18T03:25:58Z","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":"256e7962e869094f63746f3e00f36c2f75b70b7ef487085b09787d09d00e35d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-06T02:50:19Z","title_canon_sha256":"d57b87acab7c0b9c276a2f54a651b29322dc279b0b9c7cf78f22c1b8e3aed11d"},"schema_version":"1.0","source":{"id":"1305.1073","kind":"arxiv","version":2}},"canonical_sha256":"41f8c3e1e66699419e89d00ab5dbfae46c22d309b3c7d66631521f16d799c836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41f8c3e1e66699419e89d00ab5dbfae46c22d309b3c7d66631521f16d799c836","first_computed_at":"2026-05-18T03:25:58.038139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:58.038139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BbNbFdMRqaoUh542exIiNO6BgzXlp4J/Cen8pbCRwp2M1BLyP2O0dcaibaAined9P8gspjDhg90/muzaJkzZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:58.038725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1073","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d466dace308c50a7375d913ca43af59afd34f81a2b546f20109ead33bcb8e758","sha256:ca317df5ef7e2e2ea1a54939c4184f9c0d23772f997b077206147f1dbf915b4e"],"state_sha256":"5de1750bc46afc391a34df10b9805a7e54c057dd0d27c330ef28aeade393ab64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+NygIv0r/byZs2/zbYOrTSZWlwX4Rbh69/iXtgKxk0p4JNyUXtchk4Pa+78vQDEBTuNq60nIDAYxLSkfILIiDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T12:16:12.080260Z","bundle_sha256":"4f32ca2f61301a46a379a4d99f018a165f2f62340970bdd7dea592bc071c44c7"}}