{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RCLOCHFPDCSYXCM4Y6NQPZNQ6F","short_pith_number":"pith:RCLOCHFP","schema_version":"1.0","canonical_sha256":"8896e11caf18a58b899cc79b07e5b0f172d51605bf1cdff1b8ceb2513bfb3b19","source":{"kind":"arxiv","id":"1312.3034","version":2},"attestation_state":"computed","paper":{"title":"On Motzkin-Straus Type of Results and Frankl-F\\\"uredi Conjecture for Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yuejian Peng, Yuping Yao","submitted_at":"2013-12-11T04:52:20Z","abstract_excerpt":"A remarkable connection between the order of a maximum clique and the Graph-Lagrangian of a graph was established by Motzkin and Straus in 1965. This connection and its extension were useful in both combinatorics and optimization. Since then, Graph-Lagrangian has been a useful tool in extremal combinatorics. In this paper, we give a parametrized Graph-Lagrangian for non-uniform hypergraphs and provide several Motzkin-Straus type results for nonuniform hypergraphs which generalize results from [1] and [2]. Another part of the paper concerns a long-standing conjecture of Frankl-F\\\"uredi on Graph"},"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":"1312.3034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T04:52:20Z","cross_cats_sorted":[],"title_canon_sha256":"37852e24b7d20429532d244acc62ce8b33950db6eeaacb813a41590686e5ec09","abstract_canon_sha256":"350ce6475eb9ddf44f5823c7705beb97aa459ca6643913e328a25dbb06937b78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:08.234355Z","signature_b64":"IilZf4FJO3UBpVAsjgLcGHeJvygu5GTgnLbJvOTaLq5rztgngx6nYjZFHEyw/xwZF45FUP3vf3BDQBGNtw2+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8896e11caf18a58b899cc79b07e5b0f172d51605bf1cdff1b8ceb2513bfb3b19","last_reissued_at":"2026-05-18T02:51:08.233957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:08.233957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Motzkin-Straus Type of Results and Frankl-F\\\"uredi Conjecture for Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yuejian Peng, Yuping Yao","submitted_at":"2013-12-11T04:52:20Z","abstract_excerpt":"A remarkable connection between the order of a maximum clique and the Graph-Lagrangian of a graph was established by Motzkin and Straus in 1965. This connection and its extension were useful in both combinatorics and optimization. Since then, Graph-Lagrangian has been a useful tool in extremal combinatorics. In this paper, we give a parametrized Graph-Lagrangian for non-uniform hypergraphs and provide several Motzkin-Straus type results for nonuniform hypergraphs which generalize results from [1] and [2]. Another part of the paper concerns a long-standing conjecture of Frankl-F\\\"uredi on Graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3034","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":"1312.3034","created_at":"2026-05-18T02:51:08.234020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3034v2","created_at":"2026-05-18T02:51:08.234020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3034","created_at":"2026-05-18T02:51:08.234020+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCLOCHFPDCSY","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCLOCHFPDCSYXCM4","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCLOCHFP","created_at":"2026-05-18T12:27:57.521954+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/RCLOCHFPDCSYXCM4Y6NQPZNQ6F","json":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F.json","graph_json":"https://pith.science/api/pith-number/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/graph.json","events_json":"https://pith.science/api/pith-number/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/events.json","paper":"https://pith.science/paper/RCLOCHFP"},"agent_actions":{"view_html":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F","download_json":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F.json","view_paper":"https://pith.science/paper/RCLOCHFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3034&json=true","fetch_graph":"https://pith.science/api/pith-number/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/graph.json","fetch_events":"https://pith.science/api/pith-number/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/action/storage_attestation","attest_author":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/action/author_attestation","sign_citation":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/action/citation_signature","submit_replication":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/action/replication_record"}},"created_at":"2026-05-18T02:51:08.234020+00:00","updated_at":"2026-05-18T02:51:08.234020+00:00"}