{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N5OZ57UHZQUOJARTXK3NIJPPYS","short_pith_number":"pith:N5OZ57UH","canonical_record":{"source":{"id":"1810.13077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-31T02:34:39Z","cross_cats_sorted":[],"title_canon_sha256":"4b25c0e188c9d12df5cd7be678c7b58e358dcec2dee3754654024322b0b4b310","abstract_canon_sha256":"0dc59f8572953262cc3dbbff48c149bea72b388fa0af47e037a89674349c66f5"},"schema_version":"1.0"},"canonical_sha256":"6f5d9efe87cc28e48233bab6d425efc498fcede1e6eab2a0d2b078b4a48721d2","source":{"kind":"arxiv","id":"1810.13077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13077","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13077v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13077","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"N5OZ57UHZQUO","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N5OZ57UHZQUOJART","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N5OZ57UH","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N5OZ57UHZQUOJARTXK3NIJPPYS","target":"record","payload":{"canonical_record":{"source":{"id":"1810.13077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-31T02:34:39Z","cross_cats_sorted":[],"title_canon_sha256":"4b25c0e188c9d12df5cd7be678c7b58e358dcec2dee3754654024322b0b4b310","abstract_canon_sha256":"0dc59f8572953262cc3dbbff48c149bea72b388fa0af47e037a89674349c66f5"},"schema_version":"1.0"},"canonical_sha256":"6f5d9efe87cc28e48233bab6d425efc498fcede1e6eab2a0d2b078b4a48721d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:52.334512Z","signature_b64":"rBuw3S5e692ShgOlOXQCbcC2HIZGCUU600UKZ7dU6VMJEdQ25kdvolNoksMQgqcCOmP1YhFZqL48x1Ei6yRcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f5d9efe87cc28e48233bab6d425efc498fcede1e6eab2a0d2b078b4a48721d2","last_reissued_at":"2026-05-18T00:01:52.333989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:52.333989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.13077","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-18T00:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kENED9CC7Jl8WbgUoHVFGIRLyQ+LCJCIEzq+hcGiAYJAC0N99crKvxLt+9eeMox73w+iKM2UxR9T6xmk7WVZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:29:08.588483Z"},"content_sha256":"656920cf69c5d80f5a29794b0dabb4e1f3eb1a918807f341ed424944c1613938","schema_version":"1.0","event_id":"sha256:656920cf69c5d80f5a29794b0dabb4e1f3eb1a918807f341ed424944c1613938"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N5OZ57UHZQUOJARTXK3NIJPPYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lagrangian densities of hypergraph cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yuejian Peng, Zilong Yan","submitted_at":"2018-10-31T02:34:39Z","abstract_excerpt":"The Lagrangian density of an $r$-uniform hypergraph $F$ is $r!$ multiplying the supremum of the Lagrangians of all $F$-free $r$-uniform hypergraphs. For an $r$-graph $H$ with $t$ vertices, it is clear that $\\pi_{\\lambda}(H)\\ge r!\\lambda{(K_{t-1}^r)}$. We say that an $r$-unform hypergraph $H$ with $t$ vertices is perfect if $\\pi_{\\lambda}(H)= r!\\lambda{(K_{t-1}^r)}$. A theorem of Motzkin-Straus implies that all $2$-uniform graphs are perfect. It is interesting to explore what kind of hypergraphs are perfect. A hypergraph is linear if any 2 edges have at most 1 vertex in common. We propose the f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13077","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-18T00:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBXSf1xQeyxN0aTzPCjfMXwnqqnkvxe6dyth632ltXpW4ifEBhKktOa9wjo28MxhZbqVyCktfOGb186zjCUlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:29:08.588827Z"},"content_sha256":"d549a0a383f9d6ce5d6efd653c5f5de507b05bab900a864a8056eb7eb86c8346","schema_version":"1.0","event_id":"sha256:d549a0a383f9d6ce5d6efd653c5f5de507b05bab900a864a8056eb7eb86c8346"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5OZ57UHZQUOJARTXK3NIJPPYS/bundle.json","state_url":"https://pith.science/pith/N5OZ57UHZQUOJARTXK3NIJPPYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5OZ57UHZQUOJARTXK3NIJPPYS/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-04T05:29:08Z","links":{"resolver":"https://pith.science/pith/N5OZ57UHZQUOJARTXK3NIJPPYS","bundle":"https://pith.science/pith/N5OZ57UHZQUOJARTXK3NIJPPYS/bundle.json","state":"https://pith.science/pith/N5OZ57UHZQUOJARTXK3NIJPPYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5OZ57UHZQUOJARTXK3NIJPPYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N5OZ57UHZQUOJARTXK3NIJPPYS","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":"0dc59f8572953262cc3dbbff48c149bea72b388fa0af47e037a89674349c66f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-31T02:34:39Z","title_canon_sha256":"4b25c0e188c9d12df5cd7be678c7b58e358dcec2dee3754654024322b0b4b310"},"schema_version":"1.0","source":{"id":"1810.13077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13077","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13077v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13077","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"N5OZ57UHZQUO","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N5OZ57UHZQUOJART","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N5OZ57UH","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:d549a0a383f9d6ce5d6efd653c5f5de507b05bab900a864a8056eb7eb86c8346","target":"graph","created_at":"2026-05-18T00:01:52Z","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":"The Lagrangian density of an $r$-uniform hypergraph $F$ is $r!$ multiplying the supremum of the Lagrangians of all $F$-free $r$-uniform hypergraphs. For an $r$-graph $H$ with $t$ vertices, it is clear that $\\pi_{\\lambda}(H)\\ge r!\\lambda{(K_{t-1}^r)}$. We say that an $r$-unform hypergraph $H$ with $t$ vertices is perfect if $\\pi_{\\lambda}(H)= r!\\lambda{(K_{t-1}^r)}$. A theorem of Motzkin-Straus implies that all $2$-uniform graphs are perfect. It is interesting to explore what kind of hypergraphs are perfect. A hypergraph is linear if any 2 edges have at most 1 vertex in common. We propose the f","authors_text":"Yuejian Peng, Zilong Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-31T02:34:39Z","title":"Lagrangian densities of hypergraph cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13077","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:656920cf69c5d80f5a29794b0dabb4e1f3eb1a918807f341ed424944c1613938","target":"record","created_at":"2026-05-18T00:01:52Z","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":"0dc59f8572953262cc3dbbff48c149bea72b388fa0af47e037a89674349c66f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-31T02:34:39Z","title_canon_sha256":"4b25c0e188c9d12df5cd7be678c7b58e358dcec2dee3754654024322b0b4b310"},"schema_version":"1.0","source":{"id":"1810.13077","kind":"arxiv","version":1}},"canonical_sha256":"6f5d9efe87cc28e48233bab6d425efc498fcede1e6eab2a0d2b078b4a48721d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f5d9efe87cc28e48233bab6d425efc498fcede1e6eab2a0d2b078b4a48721d2","first_computed_at":"2026-05-18T00:01:52.333989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:52.333989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rBuw3S5e692ShgOlOXQCbcC2HIZGCUU600UKZ7dU6VMJEdQ25kdvolNoksMQgqcCOmP1YhFZqL48x1Ei6yRcDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:52.334512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:656920cf69c5d80f5a29794b0dabb4e1f3eb1a918807f341ed424944c1613938","sha256:d549a0a383f9d6ce5d6efd653c5f5de507b05bab900a864a8056eb7eb86c8346"],"state_sha256":"5c0ef82a960ca5e55f355fb9adb7517b7327fc7191b01325a5846553666b9a87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RsR3Ag/sjF/uE4+7fVUpvTNM7WTBKHyBRdIvIgJn1InvcGLdfB23Shmd6Se/UTz2TaGdebEeU3yqD5JUd0elCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:29:08.590801Z","bundle_sha256":"0af7461c28351f74115a256e0d134e8fa7b86e33354304f65306cd25d45fb903"}}