{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:F6WPXXHU6N6HFK55PVDJ34M2WZ","short_pith_number":"pith:F6WPXXHU","canonical_record":{"source":{"id":"1212.2795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-12T12:41:53Z","cross_cats_sorted":[],"title_canon_sha256":"58563001379afbc049ecbd9df20106d6f2a8720eaf75802e47c8eff82868219d","abstract_canon_sha256":"32b3bcd2936d9c10d3ab4025672e458b98282d193350dec7dad6c442b8531b1e"},"schema_version":"1.0"},"canonical_sha256":"2facfbdcf4f37c72abbd7d469df19ab6500523254ea3a552ebe00cd026ca8d43","source":{"kind":"arxiv","id":"1212.2795","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2795","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2795v1","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2795","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"F6WPXXHU6N6H","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F6WPXXHU6N6HFK55","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F6WPXXHU","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:F6WPXXHU6N6HFK55PVDJ34M2WZ","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-12T12:41:53Z","cross_cats_sorted":[],"title_canon_sha256":"58563001379afbc049ecbd9df20106d6f2a8720eaf75802e47c8eff82868219d","abstract_canon_sha256":"32b3bcd2936d9c10d3ab4025672e458b98282d193350dec7dad6c442b8531b1e"},"schema_version":"1.0"},"canonical_sha256":"2facfbdcf4f37c72abbd7d469df19ab6500523254ea3a552ebe00cd026ca8d43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:35.359310Z","signature_b64":"a7Zj6hENqE4DNG6QxhXAeRy/qDvzuL1w/cOMMyYou1Tz4yqkgFzae5FXQ/InoYGvQSUXgg3CI5hVRJrgUE9xAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2facfbdcf4f37c72abbd7d469df19ab6500523254ea3a552ebe00cd026ca8d43","last_reissued_at":"2026-05-18T03:38:35.358589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:35.358589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2795","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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUUFCisUC9gGRrNZlOVO+0+F9MP+odFACC+hEhSE/QjMGyK3y6SqkutCohACY8yZJTSDBWboTWKbUpTRIyaAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:02:37.777421Z"},"content_sha256":"e67227611caaf31e21e38c887e2eae762376dbf121724a36e4cfbf6d50820cab","schema_version":"1.0","event_id":"sha256:e67227611caaf31e21e38c887e2eae762376dbf121724a36e4cfbf6d50820cab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:F6WPXXHU6N6HFK55PVDJ34M2WZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Lagrangians of r-uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheng Zhao, Qingsong Tang, Yuejian Peng","submitted_at":"2012-12-12T12:41:53Z","abstract_excerpt":"A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus in [7]. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It has been also applied in spectral graph theory. Estimating the Lagrangians of hypergraphs has been successfully applied in the course of studying the Turan densities of several hypergraphs as well. It is useful in practice if Motzkin-Straus type results hold for hypergraphs. However, the obvious generalization of Mot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2795","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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/QLZYVppuIaNZ39EKzmdZgLnfxrCLxOCs+g3jbnKaXpCOxl52Z9ytBD+64QxwklZm6TDd6TzcAX7L+yZzV0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:02:37.778056Z"},"content_sha256":"f8773972b8fcbcb8c2137b34f4f0f4bd930c66e73270a525c808adfd7120d12b","schema_version":"1.0","event_id":"sha256:f8773972b8fcbcb8c2137b34f4f0f4bd930c66e73270a525c808adfd7120d12b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6WPXXHU6N6HFK55PVDJ34M2WZ/bundle.json","state_url":"https://pith.science/pith/F6WPXXHU6N6HFK55PVDJ34M2WZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6WPXXHU6N6HFK55PVDJ34M2WZ/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-06-04T03:02:37Z","links":{"resolver":"https://pith.science/pith/F6WPXXHU6N6HFK55PVDJ34M2WZ","bundle":"https://pith.science/pith/F6WPXXHU6N6HFK55PVDJ34M2WZ/bundle.json","state":"https://pith.science/pith/F6WPXXHU6N6HFK55PVDJ34M2WZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6WPXXHU6N6HFK55PVDJ34M2WZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:F6WPXXHU6N6HFK55PVDJ34M2WZ","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":"32b3bcd2936d9c10d3ab4025672e458b98282d193350dec7dad6c442b8531b1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-12T12:41:53Z","title_canon_sha256":"58563001379afbc049ecbd9df20106d6f2a8720eaf75802e47c8eff82868219d"},"schema_version":"1.0","source":{"id":"1212.2795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2795","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2795v1","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2795","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"F6WPXXHU6N6H","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F6WPXXHU6N6HFK55","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F6WPXXHU","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:f8773972b8fcbcb8c2137b34f4f0f4bd930c66e73270a525c808adfd7120d12b","target":"graph","created_at":"2026-05-18T03:38:35Z","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":"A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus in [7]. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It has been also applied in spectral graph theory. Estimating the Lagrangians of hypergraphs has been successfully applied in the course of studying the Turan densities of several hypergraphs as well. It is useful in practice if Motzkin-Straus type results hold for hypergraphs. However, the obvious generalization of Mot","authors_text":"Cheng Zhao, Qingsong Tang, Yuejian Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-12T12:41:53Z","title":"On Lagrangians of r-uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2795","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:e67227611caaf31e21e38c887e2eae762376dbf121724a36e4cfbf6d50820cab","target":"record","created_at":"2026-05-18T03:38:35Z","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":"32b3bcd2936d9c10d3ab4025672e458b98282d193350dec7dad6c442b8531b1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-12T12:41:53Z","title_canon_sha256":"58563001379afbc049ecbd9df20106d6f2a8720eaf75802e47c8eff82868219d"},"schema_version":"1.0","source":{"id":"1212.2795","kind":"arxiv","version":1}},"canonical_sha256":"2facfbdcf4f37c72abbd7d469df19ab6500523254ea3a552ebe00cd026ca8d43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2facfbdcf4f37c72abbd7d469df19ab6500523254ea3a552ebe00cd026ca8d43","first_computed_at":"2026-05-18T03:38:35.358589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:35.358589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a7Zj6hENqE4DNG6QxhXAeRy/qDvzuL1w/cOMMyYou1Tz4yqkgFzae5FXQ/InoYGvQSUXgg3CI5hVRJrgUE9xAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:35.359310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e67227611caaf31e21e38c887e2eae762376dbf121724a36e4cfbf6d50820cab","sha256:f8773972b8fcbcb8c2137b34f4f0f4bd930c66e73270a525c808adfd7120d12b"],"state_sha256":"38fcedce553df2857e093181e3bdf5be7c4b9eee99fa62c53cb6d48b8db881fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLVS6sO5sj+EyOCZ1UAjQUch25E3nx3Wooy2PH89MU2B2UMyBHNppamscCEsIL+10oaNedHG6o3P+/HEvqXADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:02:37.781358Z","bundle_sha256":"7f544b7c24227218f52f8bea58600943b1c3b2e5f2526255a5ceb5620010e7c6"}}