{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EONW7V2G4K2CNK7YKEB4LQETTN","short_pith_number":"pith:EONW7V2G","schema_version":"1.0","canonical_sha256":"239b6fd746e2b426abf85103c5c0939b50e070218264f5a794983e348367a956","source":{"kind":"arxiv","id":"1405.2855","version":1},"attestation_state":"computed","paper":{"title":"On hypergraph Lagrangians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheng Zhao, Qingsong Tang, Xiangde Zhang, Xiaojun Lu","submitted_at":"2014-04-30T14:31:55Z","abstract_excerpt":"It is conjectured by Frankl and F\\\"uredi that the $r$-uniform hypergraph with $m$ edges formed by taking the first $m$ sets in the colex ordering of ${\\mathbb N}^{(r)}$ has the largest Lagrangian of all $r$-uniform hypergraphs with $m$ edges in \\cite{FF}. Motzkin and Straus' theorem confirms this conjecture when $r=2$. For $r=3$, it is shown by Talbot in \\cite{T} that this conjecture is true when $m$ is in certain ranges. In this paper, we explore the connection between the clique number and Lagrangians for $r$-uniform hypergraphs. As an implication of this connection, we prove that the $r$-un"},"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":"1405.2855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-30T14:31:55Z","cross_cats_sorted":[],"title_canon_sha256":"ac4a4135c2aef74763fec4041fe9f369e800dd347ec1ccae1330fda67507e697","abstract_canon_sha256":"3a3a6886294db1590267c8765eebfdcbd14e7c6feb0b473b778a9e780d6b6a47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:04.661891Z","signature_b64":"9GOvtVnV7sNu7XP7HzTsvAXieg4QWNx84NEC47BTJzGAZ3lF0fC7aTYPv9sB3239dKN5gwbtEapvqdtr+KWYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"239b6fd746e2b426abf85103c5c0939b50e070218264f5a794983e348367a956","last_reissued_at":"2026-05-18T02:52:04.661432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:04.661432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On hypergraph Lagrangians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheng Zhao, Qingsong Tang, Xiangde Zhang, Xiaojun Lu","submitted_at":"2014-04-30T14:31:55Z","abstract_excerpt":"It is conjectured by Frankl and F\\\"uredi that the $r$-uniform hypergraph with $m$ edges formed by taking the first $m$ sets in the colex ordering of ${\\mathbb N}^{(r)}$ has the largest Lagrangian of all $r$-uniform hypergraphs with $m$ edges in \\cite{FF}. Motzkin and Straus' theorem confirms this conjecture when $r=2$. For $r=3$, it is shown by Talbot in \\cite{T} that this conjecture is true when $m$ is in certain ranges. In this paper, we explore the connection between the clique number and Lagrangians for $r$-uniform hypergraphs. As an implication of this connection, we prove that the $r$-un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2855","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":"1405.2855","created_at":"2026-05-18T02:52:04.661493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2855v1","created_at":"2026-05-18T02:52:04.661493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2855","created_at":"2026-05-18T02:52:04.661493+00:00"},{"alias_kind":"pith_short_12","alias_value":"EONW7V2G4K2C","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EONW7V2G4K2CNK7Y","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EONW7V2G","created_at":"2026-05-18T12:28:28.263976+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/EONW7V2G4K2CNK7YKEB4LQETTN","json":"https://pith.science/pith/EONW7V2G4K2CNK7YKEB4LQETTN.json","graph_json":"https://pith.science/api/pith-number/EONW7V2G4K2CNK7YKEB4LQETTN/graph.json","events_json":"https://pith.science/api/pith-number/EONW7V2G4K2CNK7YKEB4LQETTN/events.json","paper":"https://pith.science/paper/EONW7V2G"},"agent_actions":{"view_html":"https://pith.science/pith/EONW7V2G4K2CNK7YKEB4LQETTN","download_json":"https://pith.science/pith/EONW7V2G4K2CNK7YKEB4LQETTN.json","view_paper":"https://pith.science/paper/EONW7V2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2855&json=true","fetch_graph":"https://pith.science/api/pith-number/EONW7V2G4K2CNK7YKEB4LQETTN/graph.json","fetch_events":"https://pith.science/api/pith-number/EONW7V2G4K2CNK7YKEB4LQETTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EONW7V2G4K2CNK7YKEB4LQETTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EONW7V2G4K2CNK7YKEB4LQETTN/action/storage_attestation","attest_author":"https://pith.science/pith/EONW7V2G4K2CNK7YKEB4LQETTN/action/author_attestation","sign_citation":"https://pith.science/pith/EONW7V2G4K2CNK7YKEB4LQETTN/action/citation_signature","submit_replication":"https://pith.science/pith/EONW7V2G4K2CNK7YKEB4LQETTN/action/replication_record"}},"created_at":"2026-05-18T02:52:04.661493+00:00","updated_at":"2026-05-18T02:52:04.661493+00:00"}