{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MPV2BNL22AKXTBVLWCMVYQ53KU","short_pith_number":"pith:MPV2BNL2","schema_version":"1.0","canonical_sha256":"63eba0b57ad0157986abb0995c43bb550a13e4a3031dfba29e862dd64726609b","source":{"kind":"arxiv","id":"1308.1654","version":3},"attestation_state":"computed","paper":{"title":"Analytic methods for uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Nikiforov","submitted_at":"2013-08-07T18:40:19Z","abstract_excerpt":"This paper develops analityc methods for investigating uniform hypergraphs. Its starting point is the spectral theory of 2-graphs, in particular, the largest and the smallest eigenvalues of 2-graphs. On the one hand, this simple setup is extended to weighted r-graphs, and on the other, the eigenvalues-numbers are generalized to eigenvalues-functions, which encompass also other graph parameters like Lagrangians and number of edges. The resulting theory is new even for 2-graphs, where well-settled topics become challenges again. The paper covers a multitude of topics, with more than a hundred co"},"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":"1308.1654","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-07T18:40:19Z","cross_cats_sorted":[],"title_canon_sha256":"e6a00ac482fdfae8618b1732f61f441b50171b9cf7a37a3b7c0fd85aee9d2eff","abstract_canon_sha256":"5ce004b9c544284dd52ec23d41f3dacbd532a5eec4ccd69a6c3ba6f3c9a61c9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:05.552745Z","signature_b64":"qjoMR7EWsGxL8Gz2a/OylR6O7E2ajX9XYE6xaRzTzoMMf49JnDehViwFJEALeyRDCvDPW1uS1i8Knrh332oZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63eba0b57ad0157986abb0995c43bb550a13e4a3031dfba29e862dd64726609b","last_reissued_at":"2026-05-18T03:16:05.552176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:05.552176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analytic methods for uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Nikiforov","submitted_at":"2013-08-07T18:40:19Z","abstract_excerpt":"This paper develops analityc methods for investigating uniform hypergraphs. Its starting point is the spectral theory of 2-graphs, in particular, the largest and the smallest eigenvalues of 2-graphs. On the one hand, this simple setup is extended to weighted r-graphs, and on the other, the eigenvalues-numbers are generalized to eigenvalues-functions, which encompass also other graph parameters like Lagrangians and number of edges. The resulting theory is new even for 2-graphs, where well-settled topics become challenges again. The paper covers a multitude of topics, with more than a hundred co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1654","kind":"arxiv","version":3},"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":"1308.1654","created_at":"2026-05-18T03:16:05.552252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1654v3","created_at":"2026-05-18T03:16:05.552252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1654","created_at":"2026-05-18T03:16:05.552252+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPV2BNL22AKX","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPV2BNL22AKXTBVL","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPV2BNL2","created_at":"2026-05-18T12:27:52.871228+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/MPV2BNL22AKXTBVLWCMVYQ53KU","json":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU.json","graph_json":"https://pith.science/api/pith-number/MPV2BNL22AKXTBVLWCMVYQ53KU/graph.json","events_json":"https://pith.science/api/pith-number/MPV2BNL22AKXTBVLWCMVYQ53KU/events.json","paper":"https://pith.science/paper/MPV2BNL2"},"agent_actions":{"view_html":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU","download_json":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU.json","view_paper":"https://pith.science/paper/MPV2BNL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1654&json=true","fetch_graph":"https://pith.science/api/pith-number/MPV2BNL22AKXTBVLWCMVYQ53KU/graph.json","fetch_events":"https://pith.science/api/pith-number/MPV2BNL22AKXTBVLWCMVYQ53KU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU/action/storage_attestation","attest_author":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU/action/author_attestation","sign_citation":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU/action/citation_signature","submit_replication":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU/action/replication_record"}},"created_at":"2026-05-18T03:16:05.552252+00:00","updated_at":"2026-05-18T03:16:05.552252+00:00"}