{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CMVUPVLYF3TXAE5FHJ6XSAPFI6","short_pith_number":"pith:CMVUPVLY","schema_version":"1.0","canonical_sha256":"132b47d5782ee77013a53a7d7901e5478674fe5084f714ee5d09c3346e7ebb04","source":{"kind":"arxiv","id":"1312.6973","version":1},"attestation_state":"computed","paper":{"title":"On hypergraph cliques and polynomial programming","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-12-25T13:45:48Z","abstract_excerpt":"Motzkin and Straus established a close connection between the maximum clique problem and a solution (namely graph-Lagrangians) to the maximum value of a class of homogeneous quadratic multilinear functions over the standard simplex of the Euclidean space in 1965. This connection provides a new proof of Tur\\'an's theorem. Recently, an extension of Motzkin-Straus theorem was proved for non-uniform hypergraphs whose edges contain 1 or 2 vertices in \\cite{PPTZ}. It is interesting if similar results hold for other non-uniform hypergraphs. In this paper, we give some connection between polynomial pr"},"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.6973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-25T13:45:48Z","cross_cats_sorted":[],"title_canon_sha256":"05fd83572a0696d80e633204a2c63356a0e5a590ee42baa58e2ad92e9e0c7299","abstract_canon_sha256":"38378ced82558c0b160aa90e7477e77a4de2c50d19c5d231b3c97a1561c42fcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:46.262691Z","signature_b64":"0c0u/EQPqdY+eY0kMmkuuVxDwp/eBfoYXMa3wsozkprlsRwdPvfM5nz3JumaWudU3ZPwlhuT/4eygtDP5BU0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"132b47d5782ee77013a53a7d7901e5478674fe5084f714ee5d09c3346e7ebb04","last_reissued_at":"2026-05-18T03:03:46.262076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:46.262076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On hypergraph cliques and polynomial programming","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-12-25T13:45:48Z","abstract_excerpt":"Motzkin and Straus established a close connection between the maximum clique problem and a solution (namely graph-Lagrangians) to the maximum value of a class of homogeneous quadratic multilinear functions over the standard simplex of the Euclidean space in 1965. This connection provides a new proof of Tur\\'an's theorem. Recently, an extension of Motzkin-Straus theorem was proved for non-uniform hypergraphs whose edges contain 1 or 2 vertices in \\cite{PPTZ}. It is interesting if similar results hold for other non-uniform hypergraphs. In this paper, we give some connection between polynomial pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6973","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":"1312.6973","created_at":"2026-05-18T03:03:46.262170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6973v1","created_at":"2026-05-18T03:03:46.262170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6973","created_at":"2026-05-18T03:03:46.262170+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMVUPVLYF3TX","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMVUPVLYF3TXAE5F","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMVUPVLY","created_at":"2026-05-18T12:27:40.988391+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/CMVUPVLYF3TXAE5FHJ6XSAPFI6","json":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6.json","graph_json":"https://pith.science/api/pith-number/CMVUPVLYF3TXAE5FHJ6XSAPFI6/graph.json","events_json":"https://pith.science/api/pith-number/CMVUPVLYF3TXAE5FHJ6XSAPFI6/events.json","paper":"https://pith.science/paper/CMVUPVLY"},"agent_actions":{"view_html":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6","download_json":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6.json","view_paper":"https://pith.science/paper/CMVUPVLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6973&json=true","fetch_graph":"https://pith.science/api/pith-number/CMVUPVLYF3TXAE5FHJ6XSAPFI6/graph.json","fetch_events":"https://pith.science/api/pith-number/CMVUPVLYF3TXAE5FHJ6XSAPFI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6/action/storage_attestation","attest_author":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6/action/author_attestation","sign_citation":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6/action/citation_signature","submit_replication":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6/action/replication_record"}},"created_at":"2026-05-18T03:03:46.262170+00:00","updated_at":"2026-05-18T03:03:46.262170+00:00"}