{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MPV2BNL22AKXTBVLWCMVYQ53KU","short_pith_number":"pith:MPV2BNL2","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"},"canonical_sha256":"63eba0b57ad0157986abb0995c43bb550a13e4a3031dfba29e862dd64726609b","source":{"kind":"arxiv","id":"1308.1654","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1654","created_at":"2026-05-18T03:16:05Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1654v3","created_at":"2026-05-18T03:16:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1654","created_at":"2026-05-18T03:16:05Z"},{"alias_kind":"pith_short_12","alias_value":"MPV2BNL22AKX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MPV2BNL22AKXTBVL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MPV2BNL2","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MPV2BNL22AKXTBVLWCMVYQ53KU","target":"record","payload":{"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"},"canonical_sha256":"63eba0b57ad0157986abb0995c43bb550a13e4a3031dfba29e862dd64726609b","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"},"source_kind":"arxiv","source_id":"1308.1654","source_version":3,"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:16:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DtKvrGlOZQbi0ZrhDJvsknZeF7HaMpVQU/zumujo2kUZJiIgY+AWiIErPbpjNv5X6S5pVTFDFsK9HydDJVvBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:52:41.622939Z"},"content_sha256":"2794d6f1bbb20c84b08d05719daf5d670c7a1a5f4affadc59726a19f730cc6af","schema_version":"1.0","event_id":"sha256:2794d6f1bbb20c84b08d05719daf5d670c7a1a5f4affadc59726a19f730cc6af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MPV2BNL22AKXTBVLWCMVYQ53KU","target":"graph","payload":{"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"},"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:16:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bCZxPliVMN5Sw+bVaY7MNbHDxKSQ87flTCiMXXvmvIWlAtrHCZrJBtUZavUWVoRMHzFLprLUDEFjX/qWHdJcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:52:41.623600Z"},"content_sha256":"36c24fac49287fab5c79663037b205a2dd75dd69372b9dcb292e742d9cc441b5","schema_version":"1.0","event_id":"sha256:36c24fac49287fab5c79663037b205a2dd75dd69372b9dcb292e742d9cc441b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU/bundle.json","state_url":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPV2BNL22AKXTBVLWCMVYQ53KU/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-26T04:52:41Z","links":{"resolver":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU","bundle":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU/bundle.json","state":"https://pith.science/pith/MPV2BNL22AKXTBVLWCMVYQ53KU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPV2BNL22AKXTBVLWCMVYQ53KU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MPV2BNL22AKXTBVLWCMVYQ53KU","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":"5ce004b9c544284dd52ec23d41f3dacbd532a5eec4ccd69a6c3ba6f3c9a61c9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-07T18:40:19Z","title_canon_sha256":"e6a00ac482fdfae8618b1732f61f441b50171b9cf7a37a3b7c0fd85aee9d2eff"},"schema_version":"1.0","source":{"id":"1308.1654","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1654","created_at":"2026-05-18T03:16:05Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1654v3","created_at":"2026-05-18T03:16:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1654","created_at":"2026-05-18T03:16:05Z"},{"alias_kind":"pith_short_12","alias_value":"MPV2BNL22AKX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MPV2BNL22AKXTBVL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MPV2BNL2","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:36c24fac49287fab5c79663037b205a2dd75dd69372b9dcb292e742d9cc441b5","target":"graph","created_at":"2026-05-18T03:16:05Z","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":"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","authors_text":"Vladimir Nikiforov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-07T18:40:19Z","title":"Analytic methods for uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1654","kind":"arxiv","version":3},"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:2794d6f1bbb20c84b08d05719daf5d670c7a1a5f4affadc59726a19f730cc6af","target":"record","created_at":"2026-05-18T03:16:05Z","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":"5ce004b9c544284dd52ec23d41f3dacbd532a5eec4ccd69a6c3ba6f3c9a61c9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-07T18:40:19Z","title_canon_sha256":"e6a00ac482fdfae8618b1732f61f441b50171b9cf7a37a3b7c0fd85aee9d2eff"},"schema_version":"1.0","source":{"id":"1308.1654","kind":"arxiv","version":3}},"canonical_sha256":"63eba0b57ad0157986abb0995c43bb550a13e4a3031dfba29e862dd64726609b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63eba0b57ad0157986abb0995c43bb550a13e4a3031dfba29e862dd64726609b","first_computed_at":"2026-05-18T03:16:05.552176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:05.552176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qjoMR7EWsGxL8Gz2a/OylR6O7E2ajX9XYE6xaRzTzoMMf49JnDehViwFJEALeyRDCvDPW1uS1i8Knrh332oZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:05.552745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1654","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2794d6f1bbb20c84b08d05719daf5d670c7a1a5f4affadc59726a19f730cc6af","sha256:36c24fac49287fab5c79663037b205a2dd75dd69372b9dcb292e742d9cc441b5"],"state_sha256":"c0799ef121424c1dba631c7e0796391670c3b39be91171020060198ab45df172"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4QsSH2obwrM2auDcyVNhzxeuIu9Mdh89DOBciz+5X/hV60TwPSw5oMpAefCVJ8MDyoGOl0S62HZpt+ORMI0kBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:52:41.627280Z","bundle_sha256":"62b0b8977cccb242a512ada5e70904bf0f8f4c2ab460159ec04138197835daf8"}}