{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NG7JXFEZQK6NSGEYL5XZCL6H2V","short_pith_number":"pith:NG7JXFEZ","schema_version":"1.0","canonical_sha256":"69be9b949982bcd918985f6f912fc7d5631d5f97ddc6f04f5a4667d492c62173","source":{"kind":"arxiv","id":"1701.06126","version":3},"attestation_state":"computed","paper":{"title":"On a conjecture of Hefetz and Keevash on Lagrangians of intersecting hypergraphs and Tur\\'an numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Biao Wu, Pingge Chen, Yuejian Peng","submitted_at":"2017-01-22T06:19:26Z","abstract_excerpt":"Let $S^r(n)$ be the $r$-graph on $n$ vertices with parts $A$ and $B$, where the edges consist of all $r$-tuples with $1$ vertex in $A$ and $r-1$ vertices in $B$, and the sizes of $A$ and $B$ are chosen to maximise the number of edges. Let $M_t^r$ be the $r$-graph with $t$ pairwise disjoint edges. Given an $r$-graph $F$ and a positive integer $p\\geq |V(F)|$, we define the {\\em extension} of $F$, denoted by $H_{p}^{F}$ as follows: Label the vertices of $F$ as $v_1,\\dots,v_{|V(F)|}$. Add new vertices $v_{|V(F)|+1},\\dots,v_{p}$. For each pair of vertices $v_i,v_j, 1\\le i<j \\le p$ not contained in "},"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.06126","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T06:19:26Z","cross_cats_sorted":[],"title_canon_sha256":"86ffb1402a138a371a7dddd4a6878ff4306f7725fbf8a8dca59a193822937216","abstract_canon_sha256":"3d1df50cc42880b58aca266d74e7feaa3548985c93010d7fef1dfd0c06c139f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:33.651454Z","signature_b64":"izIDfqPzRxwxIe79DK7pLQ8XjlhMeuP/YFUrAeG5mnOEsTecMcwWfqA4TzSI4aGKCxBjdmLRv2ItS3ZXqZ14Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69be9b949982bcd918985f6f912fc7d5631d5f97ddc6f04f5a4667d492c62173","last_reissued_at":"2026-05-18T00:51:33.650822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:33.650822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a conjecture of Hefetz and Keevash on Lagrangians of intersecting hypergraphs and Tur\\'an numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Biao Wu, Pingge Chen, Yuejian Peng","submitted_at":"2017-01-22T06:19:26Z","abstract_excerpt":"Let $S^r(n)$ be the $r$-graph on $n$ vertices with parts $A$ and $B$, where the edges consist of all $r$-tuples with $1$ vertex in $A$ and $r-1$ vertices in $B$, and the sizes of $A$ and $B$ are chosen to maximise the number of edges. Let $M_t^r$ be the $r$-graph with $t$ pairwise disjoint edges. Given an $r$-graph $F$ and a positive integer $p\\geq |V(F)|$, we define the {\\em extension} of $F$, denoted by $H_{p}^{F}$ as follows: Label the vertices of $F$ as $v_1,\\dots,v_{|V(F)|}$. Add new vertices $v_{|V(F)|+1},\\dots,v_{p}$. For each pair of vertices $v_i,v_j, 1\\le i<j \\le p$ not contained in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06126","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.06126","created_at":"2026-05-18T00:51:33.650916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06126v3","created_at":"2026-05-18T00:51:33.650916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06126","created_at":"2026-05-18T00:51:33.650916+00:00"},{"alias_kind":"pith_short_12","alias_value":"NG7JXFEZQK6N","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NG7JXFEZQK6NSGEY","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NG7JXFEZ","created_at":"2026-05-18T12:31:31.346846+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/NG7JXFEZQK6NSGEYL5XZCL6H2V","json":"https://pith.science/pith/NG7JXFEZQK6NSGEYL5XZCL6H2V.json","graph_json":"https://pith.science/api/pith-number/NG7JXFEZQK6NSGEYL5XZCL6H2V/graph.json","events_json":"https://pith.science/api/pith-number/NG7JXFEZQK6NSGEYL5XZCL6H2V/events.json","paper":"https://pith.science/paper/NG7JXFEZ"},"agent_actions":{"view_html":"https://pith.science/pith/NG7JXFEZQK6NSGEYL5XZCL6H2V","download_json":"https://pith.science/pith/NG7JXFEZQK6NSGEYL5XZCL6H2V.json","view_paper":"https://pith.science/paper/NG7JXFEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06126&json=true","fetch_graph":"https://pith.science/api/pith-number/NG7JXFEZQK6NSGEYL5XZCL6H2V/graph.json","fetch_events":"https://pith.science/api/pith-number/NG7JXFEZQK6NSGEYL5XZCL6H2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NG7JXFEZQK6NSGEYL5XZCL6H2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NG7JXFEZQK6NSGEYL5XZCL6H2V/action/storage_attestation","attest_author":"https://pith.science/pith/NG7JXFEZQK6NSGEYL5XZCL6H2V/action/author_attestation","sign_citation":"https://pith.science/pith/NG7JXFEZQK6NSGEYL5XZCL6H2V/action/citation_signature","submit_replication":"https://pith.science/pith/NG7JXFEZQK6NSGEYL5XZCL6H2V/action/replication_record"}},"created_at":"2026-05-18T00:51:33.650916+00:00","updated_at":"2026-05-18T00:51:33.650916+00:00"}