{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TB45YSJLA5DXI6JAVYJCT6QTF3","short_pith_number":"pith:TB45YSJL","schema_version":"1.0","canonical_sha256":"9879dc492b0747747920ae1229fa132ed36f40023bde9d7651148c2d227027ad","source":{"kind":"arxiv","id":"1311.1062","version":2},"attestation_state":"computed","paper":{"title":"On the largest graph-Lagrangians of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheng Zhao, Qingsong Tang, Xiangde Zhang, Yuejian Peng","submitted_at":"2013-11-05T14:23:00Z","abstract_excerpt":"Frankl and F\\\"uredi (1989) conjectured that the $r$-graph with $m$ edges formed by taking the first $m$ sets in the colex ordering of ${\\mathbb N}^{(r)}$ has the largest graph-Lagrangian of all $r$-graphs with $m$ edges. In this paper, we establish some bounds for graph-Lagrangians of some special $r$-graphs that support this conjecture."},"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":"1311.1062","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-05T14:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"fdf5fe981a663597e4be8606030a042115cc443b7937a980e2150ea49762873f","abstract_canon_sha256":"103ad819378daa06ae82eaf613fdc9906c8e7d8e052c143fc36fb2d2b5cf1e57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:31.728735Z","signature_b64":"DPiemDej1FzyB6E6rtyZpZdR2BBT4Icp0uU3cvASV3vHciNrxLPc7lX7jERYR2xarekMfDJ1WNmd6JuoEKUYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9879dc492b0747747920ae1229fa132ed36f40023bde9d7651148c2d227027ad","last_reissued_at":"2026-05-18T02:44:31.728279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:31.728279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the largest graph-Lagrangians of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheng Zhao, Qingsong Tang, Xiangde Zhang, Yuejian Peng","submitted_at":"2013-11-05T14:23:00Z","abstract_excerpt":"Frankl and F\\\"uredi (1989) conjectured that the $r$-graph with $m$ edges formed by taking the first $m$ sets in the colex ordering of ${\\mathbb N}^{(r)}$ has the largest graph-Lagrangian of all $r$-graphs with $m$ edges. In this paper, we establish some bounds for graph-Lagrangians of some special $r$-graphs that support this conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1062","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":"1311.1062","created_at":"2026-05-18T02:44:31.728352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1062v2","created_at":"2026-05-18T02:44:31.728352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1062","created_at":"2026-05-18T02:44:31.728352+00:00"},{"alias_kind":"pith_short_12","alias_value":"TB45YSJLA5DX","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"TB45YSJLA5DXI6JA","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"TB45YSJL","created_at":"2026-05-18T12:27:59.945178+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/TB45YSJLA5DXI6JAVYJCT6QTF3","json":"https://pith.science/pith/TB45YSJLA5DXI6JAVYJCT6QTF3.json","graph_json":"https://pith.science/api/pith-number/TB45YSJLA5DXI6JAVYJCT6QTF3/graph.json","events_json":"https://pith.science/api/pith-number/TB45YSJLA5DXI6JAVYJCT6QTF3/events.json","paper":"https://pith.science/paper/TB45YSJL"},"agent_actions":{"view_html":"https://pith.science/pith/TB45YSJLA5DXI6JAVYJCT6QTF3","download_json":"https://pith.science/pith/TB45YSJLA5DXI6JAVYJCT6QTF3.json","view_paper":"https://pith.science/paper/TB45YSJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1062&json=true","fetch_graph":"https://pith.science/api/pith-number/TB45YSJLA5DXI6JAVYJCT6QTF3/graph.json","fetch_events":"https://pith.science/api/pith-number/TB45YSJLA5DXI6JAVYJCT6QTF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TB45YSJLA5DXI6JAVYJCT6QTF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TB45YSJLA5DXI6JAVYJCT6QTF3/action/storage_attestation","attest_author":"https://pith.science/pith/TB45YSJLA5DXI6JAVYJCT6QTF3/action/author_attestation","sign_citation":"https://pith.science/pith/TB45YSJLA5DXI6JAVYJCT6QTF3/action/citation_signature","submit_replication":"https://pith.science/pith/TB45YSJLA5DXI6JAVYJCT6QTF3/action/replication_record"}},"created_at":"2026-05-18T02:44:31.728352+00:00","updated_at":"2026-05-18T02:44:31.728352+00:00"}