{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4VZ56Q3GITPJX45YIRTUPVRUYC","short_pith_number":"pith:4VZ56Q3G","schema_version":"1.0","canonical_sha256":"e573df436644de9bf3b8446747d634c090fe31e7e8022f92031a16c18a3f21ec","source":{"kind":"arxiv","id":"1701.06139","version":1},"attestation_state":"computed","paper":{"title":"Dense $3$-uniform hypergraphs containing a large clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Biao Wu, Yuejian Peng","submitted_at":"2017-01-22T08:43:48Z","abstract_excerpt":"An $r$-uniform graph $G$ is dense if and only if every proper subgraph $G'$ of $G$ satisfies $\\lambda (G') < \\lambda (G)$, where $\\lambda (G)$ is the Lagrangian of a hypergraph $G$. In 1980's, Sidorenko showed that $\\pi(F)$, the Tur\\'an density of an $r$-uniform hypergraph $F$ is $r!$ multiplying the supremum of the Lagrangians of all dense $F$-hom-free $r$-uniform hypergraphs. This connection has been applied in estimating Tur\\'an density of hypergraphs. When $r=2$, the result of Motzkin and Straus shows that a graph is dense if and only if it is a complete graph. However, when $r\\ge 3$, it b"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.06139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T08:43:48Z","cross_cats_sorted":[],"title_canon_sha256":"56e7ff839e5e69add9d708e72ab182a9e7fab53989b90e7732736d79cf79f3cd","abstract_canon_sha256":"428f1c5f099edc7ca86eacfeeae012269c9e97c65c1c78c3b429e50e475d5c02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:19.179002Z","signature_b64":"LmyA+5wKDzTkLDSzysJ5IbXMIzy35GDEH2kcTotvEQc4FSom4B7EndHUN9Kuh53Mbf5l3aYie4OMU+WUnl07BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e573df436644de9bf3b8446747d634c090fe31e7e8022f92031a16c18a3f21ec","last_reissued_at":"2026-05-18T00:52:19.178562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:19.178562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dense $3$-uniform hypergraphs containing a large clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Biao Wu, Yuejian Peng","submitted_at":"2017-01-22T08:43:48Z","abstract_excerpt":"An $r$-uniform graph $G$ is dense if and only if every proper subgraph $G'$ of $G$ satisfies $\\lambda (G') < \\lambda (G)$, where $\\lambda (G)$ is the Lagrangian of a hypergraph $G$. In 1980's, Sidorenko showed that $\\pi(F)$, the Tur\\'an density of an $r$-uniform hypergraph $F$ is $r!$ multiplying the supremum of the Lagrangians of all dense $F$-hom-free $r$-uniform hypergraphs. This connection has been applied in estimating Tur\\'an density of hypergraphs. When $r=2$, the result of Motzkin and Straus shows that a graph is dense if and only if it is a complete graph. However, when $r\\ge 3$, it b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06139","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.06139","created_at":"2026-05-18T00:52:19.178636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06139v1","created_at":"2026-05-18T00:52:19.178636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06139","created_at":"2026-05-18T00:52:19.178636+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VZ56Q3GITPJ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VZ56Q3GITPJX45Y","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VZ56Q3G","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4VZ56Q3GITPJX45YIRTUPVRUYC","json":"https://pith.science/pith/4VZ56Q3GITPJX45YIRTUPVRUYC.json","graph_json":"https://pith.science/api/pith-number/4VZ56Q3GITPJX45YIRTUPVRUYC/graph.json","events_json":"https://pith.science/api/pith-number/4VZ56Q3GITPJX45YIRTUPVRUYC/events.json","paper":"https://pith.science/paper/4VZ56Q3G"},"agent_actions":{"view_html":"https://pith.science/pith/4VZ56Q3GITPJX45YIRTUPVRUYC","download_json":"https://pith.science/pith/4VZ56Q3GITPJX45YIRTUPVRUYC.json","view_paper":"https://pith.science/paper/4VZ56Q3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06139&json=true","fetch_graph":"https://pith.science/api/pith-number/4VZ56Q3GITPJX45YIRTUPVRUYC/graph.json","fetch_events":"https://pith.science/api/pith-number/4VZ56Q3GITPJX45YIRTUPVRUYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VZ56Q3GITPJX45YIRTUPVRUYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VZ56Q3GITPJX45YIRTUPVRUYC/action/storage_attestation","attest_author":"https://pith.science/pith/4VZ56Q3GITPJX45YIRTUPVRUYC/action/author_attestation","sign_citation":"https://pith.science/pith/4VZ56Q3GITPJX45YIRTUPVRUYC/action/citation_signature","submit_replication":"https://pith.science/pith/4VZ56Q3GITPJX45YIRTUPVRUYC/action/replication_record"}},"created_at":"2026-05-18T00:52:19.178636+00:00","updated_at":"2026-05-18T00:52:19.178636+00:00"}