{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YR5U6UCT7CC5L4PADR77VXVE5Y","short_pith_number":"pith:YR5U6UCT","canonical_record":{"source":{"id":"1211.6508","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-28T03:22:33Z","cross_cats_sorted":[],"title_canon_sha256":"09936bc1dbc78597c2b8fc7f5ed8414b4fe198053168e7a28cdbb9132da8afa2","abstract_canon_sha256":"54d3f0ebfc10c436d41059600521fdda74e078d424676c6f64a9fed81196f272"},"schema_version":"1.0"},"canonical_sha256":"c47b4f5053f885d5f1e01c7ffadea4ee2a98fad1a44101fedab60140b372ddf9","source":{"kind":"arxiv","id":"1211.6508","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6508","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6508v3","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6508","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"pith_short_12","alias_value":"YR5U6UCT7CC5","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YR5U6UCT7CC5L4PA","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YR5U6UCT","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YR5U6UCT7CC5L4PADR77VXVE5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1211.6508","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-28T03:22:33Z","cross_cats_sorted":[],"title_canon_sha256":"09936bc1dbc78597c2b8fc7f5ed8414b4fe198053168e7a28cdbb9132da8afa2","abstract_canon_sha256":"54d3f0ebfc10c436d41059600521fdda74e078d424676c6f64a9fed81196f272"},"schema_version":"1.0"},"canonical_sha256":"c47b4f5053f885d5f1e01c7ffadea4ee2a98fad1a44101fedab60140b372ddf9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:04.349861Z","signature_b64":"wlGX8goP6Pc5+/3oAj/YNXOtQ4k2CQRDvGq1O6H1jhUihDmiWdDy9aqLNSP6qBDUtXTGCMPZoEATn6yAtywoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c47b4f5053f885d5f1e01c7ffadea4ee2a98fad1a44101fedab60140b372ddf9","last_reissued_at":"2026-05-18T02:55:04.349103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:04.349103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.6508","source_version":3,"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-18T02:55:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2QM08jWdxRlCivP0+H/0YHVQS/EJd0hNrmIWiUqOaBOhbpcRvFV6/J4WL4gJffjhbbEn6ucA5o9ALc7mV9MDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:16:36.300583Z"},"content_sha256":"13ae7f4462ec71895ce5a49e9c00aa9b7872eb17d27a976574eee3da48aa6acc","schema_version":"1.0","event_id":"sha256:13ae7f4462ec71895ce5a49e9c00aa9b7872eb17d27a976574eee3da48aa6acc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YR5U6UCT7CC5L4PADR77VXVE5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Cliques and Lagrangians of 3-uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheng Zhao, Hegui Zhu, Yanling Zheng, Yuejian Peng","submitted_at":"2012-11-28T03:22:33Z","abstract_excerpt":"There is a remarkable connection between the maximum clique number and the Lagrangian of a graph given by T. S. Motzkin and E.G. Straus in 1965. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It is useful in practice if similar results hold for hypergraphs. In this paper, we explore evidences that the Lagrangian of a 3-uniform hypergraph is related to the order of its maximum cliques when the number of edges of the hypergraph is in certain range. In particular, we present some results about a conjectu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6508","kind":"arxiv","version":3},"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-18T02:55:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9IatesooWT+uzb4qPC4SHTCsRV5ViCe5yAHmZC6RlV6ZSw6VxctaiEPAKI/pOHfJyMdvF7pVMGlUidjJlvuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:16:36.301272Z"},"content_sha256":"a0ca2106dc7627c9a61c65f71f520b73df9769c56e70b11a87fa38e6d89ec23d","schema_version":"1.0","event_id":"sha256:a0ca2106dc7627c9a61c65f71f520b73df9769c56e70b11a87fa38e6d89ec23d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YR5U6UCT7CC5L4PADR77VXVE5Y/bundle.json","state_url":"https://pith.science/pith/YR5U6UCT7CC5L4PADR77VXVE5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YR5U6UCT7CC5L4PADR77VXVE5Y/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-28T16:16:36Z","links":{"resolver":"https://pith.science/pith/YR5U6UCT7CC5L4PADR77VXVE5Y","bundle":"https://pith.science/pith/YR5U6UCT7CC5L4PADR77VXVE5Y/bundle.json","state":"https://pith.science/pith/YR5U6UCT7CC5L4PADR77VXVE5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YR5U6UCT7CC5L4PADR77VXVE5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YR5U6UCT7CC5L4PADR77VXVE5Y","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":"54d3f0ebfc10c436d41059600521fdda74e078d424676c6f64a9fed81196f272","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-28T03:22:33Z","title_canon_sha256":"09936bc1dbc78597c2b8fc7f5ed8414b4fe198053168e7a28cdbb9132da8afa2"},"schema_version":"1.0","source":{"id":"1211.6508","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6508","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6508v3","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6508","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"pith_short_12","alias_value":"YR5U6UCT7CC5","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YR5U6UCT7CC5L4PA","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YR5U6UCT","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:a0ca2106dc7627c9a61c65f71f520b73df9769c56e70b11a87fa38e6d89ec23d","target":"graph","created_at":"2026-05-18T02:55:04Z","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":"There is a remarkable connection between the maximum clique number and the Lagrangian of a graph given by T. S. Motzkin and E.G. Straus in 1965. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It is useful in practice if similar results hold for hypergraphs. In this paper, we explore evidences that the Lagrangian of a 3-uniform hypergraph is related to the order of its maximum cliques when the number of edges of the hypergraph is in certain range. In particular, we present some results about a conjectu","authors_text":"Cheng Zhao, Hegui Zhu, Yanling Zheng, Yuejian Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-28T03:22:33Z","title":"On Cliques and Lagrangians of 3-uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6508","kind":"arxiv","version":3},"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:13ae7f4462ec71895ce5a49e9c00aa9b7872eb17d27a976574eee3da48aa6acc","target":"record","created_at":"2026-05-18T02:55:04Z","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":"54d3f0ebfc10c436d41059600521fdda74e078d424676c6f64a9fed81196f272","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-28T03:22:33Z","title_canon_sha256":"09936bc1dbc78597c2b8fc7f5ed8414b4fe198053168e7a28cdbb9132da8afa2"},"schema_version":"1.0","source":{"id":"1211.6508","kind":"arxiv","version":3}},"canonical_sha256":"c47b4f5053f885d5f1e01c7ffadea4ee2a98fad1a44101fedab60140b372ddf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c47b4f5053f885d5f1e01c7ffadea4ee2a98fad1a44101fedab60140b372ddf9","first_computed_at":"2026-05-18T02:55:04.349103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:04.349103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wlGX8goP6Pc5+/3oAj/YNXOtQ4k2CQRDvGq1O6H1jhUihDmiWdDy9aqLNSP6qBDUtXTGCMPZoEATn6yAtywoDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:04.349861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6508","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13ae7f4462ec71895ce5a49e9c00aa9b7872eb17d27a976574eee3da48aa6acc","sha256:a0ca2106dc7627c9a61c65f71f520b73df9769c56e70b11a87fa38e6d89ec23d"],"state_sha256":"3c428a1d4ac326cb4b3dbbbdc1a056142a5d7b47b72939d342648aac251a5cae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7kWHAxDVUuoeNGsvyDJFPcQc7XtH+XJ6AVfZbVM60VQClGKCqFlfu6qgow5OhSaO7jmq6W2CVHw4CO/LZcuAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:16:36.304991Z","bundle_sha256":"87c9fa22fe1c33f06dd308df372c11b341865e282f3485cdd6bc755c66d70ed8"}}