{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RCLOCHFPDCSYXCM4Y6NQPZNQ6F","short_pith_number":"pith:RCLOCHFP","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"},"canonical_sha256":"8896e11caf18a58b899cc79b07e5b0f172d51605bf1cdff1b8ceb2513bfb3b19","source":{"kind":"arxiv","id":"1312.3034","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3034","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3034v2","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3034","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"RCLOCHFPDCSY","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCLOCHFPDCSYXCM4","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCLOCHFP","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RCLOCHFPDCSYXCM4Y6NQPZNQ6F","target":"record","payload":{"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"},"canonical_sha256":"8896e11caf18a58b899cc79b07e5b0f172d51605bf1cdff1b8ceb2513bfb3b19","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"},"source_kind":"arxiv","source_id":"1312.3034","source_version":2,"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:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y26umnTLS3AcXYYJESEypyPf8KH/sQcnR47uVZdeViGxD3o/ewoAk2uIQeh1YPYwGal+yejwU1vGhPbqKFXoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T02:50:39.663188Z"},"content_sha256":"09064a1c3c55a2399bd2a47e23b756cc04ee1d7fb07333f98e3dc0197ee51cec","schema_version":"1.0","event_id":"sha256:09064a1c3c55a2399bd2a47e23b756cc04ee1d7fb07333f98e3dc0197ee51cec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RCLOCHFPDCSYXCM4Y6NQPZNQ6F","target":"graph","payload":{"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"},"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:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOSSUxj7dyEHweayiRMKKF8//23SgTpxOFgcjLc7eU5V37QwxKEV1S6KlYCW8dt5hQ+J/TsSKQcCxGif1PJdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T02:50:39.663752Z"},"content_sha256":"932c9647dcb9e4c0c3603926709c63fce923a18b0f81dd0630574509b52f126a","schema_version":"1.0","event_id":"sha256:932c9647dcb9e4c0c3603926709c63fce923a18b0f81dd0630574509b52f126a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/bundle.json","state_url":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/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-19T02:50:39Z","links":{"resolver":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F","bundle":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/bundle.json","state":"https://pith.science/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCLOCHFPDCSYXCM4Y6NQPZNQ6F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RCLOCHFPDCSYXCM4Y6NQPZNQ6F","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":"350ce6475eb9ddf44f5823c7705beb97aa459ca6643913e328a25dbb06937b78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T04:52:20Z","title_canon_sha256":"37852e24b7d20429532d244acc62ce8b33950db6eeaacb813a41590686e5ec09"},"schema_version":"1.0","source":{"id":"1312.3034","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3034","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3034v2","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3034","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"RCLOCHFPDCSY","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCLOCHFPDCSYXCM4","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCLOCHFP","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:932c9647dcb9e4c0c3603926709c63fce923a18b0f81dd0630574509b52f126a","target":"graph","created_at":"2026-05-18T02:51:08Z","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 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","authors_text":"Yuejian Peng, Yuping Yao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T04:52:20Z","title":"On Motzkin-Straus Type of Results and Frankl-F\\\"uredi Conjecture for Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3034","kind":"arxiv","version":2},"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:09064a1c3c55a2399bd2a47e23b756cc04ee1d7fb07333f98e3dc0197ee51cec","target":"record","created_at":"2026-05-18T02:51:08Z","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":"350ce6475eb9ddf44f5823c7705beb97aa459ca6643913e328a25dbb06937b78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T04:52:20Z","title_canon_sha256":"37852e24b7d20429532d244acc62ce8b33950db6eeaacb813a41590686e5ec09"},"schema_version":"1.0","source":{"id":"1312.3034","kind":"arxiv","version":2}},"canonical_sha256":"8896e11caf18a58b899cc79b07e5b0f172d51605bf1cdff1b8ceb2513bfb3b19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8896e11caf18a58b899cc79b07e5b0f172d51605bf1cdff1b8ceb2513bfb3b19","first_computed_at":"2026-05-18T02:51:08.233957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:08.233957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IilZf4FJO3UBpVAsjgLcGHeJvygu5GTgnLbJvOTaLq5rztgngx6nYjZFHEyw/xwZF45FUP3vf3BDQBGNtw2+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:08.234355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3034","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09064a1c3c55a2399bd2a47e23b756cc04ee1d7fb07333f98e3dc0197ee51cec","sha256:932c9647dcb9e4c0c3603926709c63fce923a18b0f81dd0630574509b52f126a"],"state_sha256":"5532b56916d343e1122a3a320777b73ff236365ed0cdb984c58e479525ec29de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZybQcRyvpA1/9slHGzpBu9G9uqALnLXOOcE5kzEk3l8JyLxjJ5b6FGWh276z4NYEUN/GHr1k3Zjhd77xWzkjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T02:50:39.665523Z","bundle_sha256":"2f5cd2a746116a07aa9d62e42f1dd63f21b9ae122f2ea4396c031d4f8ba7b072"}}