{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CMVUPVLYF3TXAE5FHJ6XSAPFI6","short_pith_number":"pith:CMVUPVLY","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"},"canonical_sha256":"132b47d5782ee77013a53a7d7901e5478674fe5084f714ee5d09c3346e7ebb04","source":{"kind":"arxiv","id":"1312.6973","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6973","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6973v1","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6973","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"CMVUPVLYF3TX","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CMVUPVLYF3TXAE5F","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CMVUPVLY","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CMVUPVLYF3TXAE5FHJ6XSAPFI6","target":"record","payload":{"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"},"canonical_sha256":"132b47d5782ee77013a53a7d7901e5478674fe5084f714ee5d09c3346e7ebb04","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"},"source_kind":"arxiv","source_id":"1312.6973","source_version":1,"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:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phx0NA30F9hN4Rq+HjUrEGqvbqhGn9hEF11hIeUS6kyE/WPfeqilU+LUxTSs6/erlBBEWEL2sGNSFkxlOHzpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:11:22.759905Z"},"content_sha256":"42fa23417286a84e39be2ef364885334507daa23950d429ca8b571e9cb695f05","schema_version":"1.0","event_id":"sha256:42fa23417286a84e39be2ef364885334507daa23950d429ca8b571e9cb695f05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CMVUPVLYF3TXAE5FHJ6XSAPFI6","target":"graph","payload":{"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"},"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:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dyFxCHGvIFREmb5qzGrc4me4uwIR7nLhwtn81p2eOOj46ZhoAs/Gdj/ObBeTEmJq5iMOgvVYi70vygp64MqzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:11:22.760273Z"},"content_sha256":"f9705ad1ea7c8dc863f43ab05382233ff697d7b58dd36c2510a002de349741ed","schema_version":"1.0","event_id":"sha256:f9705ad1ea7c8dc863f43ab05382233ff697d7b58dd36c2510a002de349741ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6/bundle.json","state_url":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6/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-31T20:11:22Z","links":{"resolver":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6","bundle":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6/bundle.json","state":"https://pith.science/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMVUPVLYF3TXAE5FHJ6XSAPFI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CMVUPVLYF3TXAE5FHJ6XSAPFI6","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":"38378ced82558c0b160aa90e7477e77a4de2c50d19c5d231b3c97a1561c42fcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-25T13:45:48Z","title_canon_sha256":"05fd83572a0696d80e633204a2c63356a0e5a590ee42baa58e2ad92e9e0c7299"},"schema_version":"1.0","source":{"id":"1312.6973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6973","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6973v1","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6973","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"CMVUPVLYF3TX","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CMVUPVLYF3TXAE5F","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CMVUPVLY","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:f9705ad1ea7c8dc863f43ab05382233ff697d7b58dd36c2510a002de349741ed","target":"graph","created_at":"2026-05-18T03:03:46Z","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":"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","authors_text":"Cheng Zhao, Qingsong Tang, Xiangde Zhang, Yuejian Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-25T13:45:48Z","title":"On hypergraph cliques and polynomial programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6973","kind":"arxiv","version":1},"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:42fa23417286a84e39be2ef364885334507daa23950d429ca8b571e9cb695f05","target":"record","created_at":"2026-05-18T03:03:46Z","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":"38378ced82558c0b160aa90e7477e77a4de2c50d19c5d231b3c97a1561c42fcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-25T13:45:48Z","title_canon_sha256":"05fd83572a0696d80e633204a2c63356a0e5a590ee42baa58e2ad92e9e0c7299"},"schema_version":"1.0","source":{"id":"1312.6973","kind":"arxiv","version":1}},"canonical_sha256":"132b47d5782ee77013a53a7d7901e5478674fe5084f714ee5d09c3346e7ebb04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"132b47d5782ee77013a53a7d7901e5478674fe5084f714ee5d09c3346e7ebb04","first_computed_at":"2026-05-18T03:03:46.262076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:46.262076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0c0u/EQPqdY+eY0kMmkuuVxDwp/eBfoYXMa3wsozkprlsRwdPvfM5nz3JumaWudU3ZPwlhuT/4eygtDP5BU0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:46.262691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6973","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42fa23417286a84e39be2ef364885334507daa23950d429ca8b571e9cb695f05","sha256:f9705ad1ea7c8dc863f43ab05382233ff697d7b58dd36c2510a002de349741ed"],"state_sha256":"19f2ede49b06f803f4e48c594bbb7269cef70b337d041c0c9bb0de425e5a40e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WjuYkcztR1CYzdsP1pr3SjxLu+k+k5qFvOiX4PVDysA20fmIijnpgb/MPWOUq6TRhdm2rGoT8qCbmvAAQ1aiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:11:22.762804Z","bundle_sha256":"143909f21dd5bb8c12761abcabf81a0e5b5c6fe3212679ab0f8a26b5e167aa0a"}}