{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:X7KLIGKV4UGK4QARAPQPAAHR5Q","short_pith_number":"pith:X7KLIGKV","schema_version":"1.0","canonical_sha256":"bfd4b41955e50cae401103e0f000f1ec0379134c8a5f257b3ab2f847b22a6a0a","source":{"kind":"arxiv","id":"2307.01647","version":1},"attestation_state":"computed","paper":{"title":"The degree and codegree threshold for generalized triangle and some trees covering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ran Gu, Shuaichao Wang","submitted_at":"2023-07-04T11:03:02Z","abstract_excerpt":"Given two $k$-uniform hypergraphs $F$ and $G$, we say that $G$ has an $F$-covering if for every vertex in $G$ there is a copy of $F$ covering it. For $1\\leq i\\leq k-1$, the minimum $i$-degree $\\delta_i(G)$ of $G$ is the minimum integer such that every $i$ vertices are contained in at least $\\delta_i(G)$ edges. Let $c_i(n,F)$ be the largest minimum $i$-degree among all $n$-vertex $k$-uniform hypergraphs that have no $F$-covering. In this paper, we consider the $F$-covering problem in $3$-uniform hypergraphs when $F$ is the generalized triangle $T$, where $T$ is a $3$-uniform hypergraph with the"},"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":"2307.01647","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-04T11:03:02Z","cross_cats_sorted":[],"title_canon_sha256":"5b92c8aebf0353b699420096bb95c15d0d9159ff68c4e647220de2fd5a659a05","abstract_canon_sha256":"0a4cc581c21f0e2efdb5946ff49a2c66c341fb07adde61ba0b6b5e953d13bbb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:27:59.179813Z","signature_b64":"8fIU7iWerl326JCSbQgwiRInWKGxv5m8+CHRYJNkGopf6zDswFHl8bLSUsAPd6isr60watjsLxwA+ID5YRLRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfd4b41955e50cae401103e0f000f1ec0379134c8a5f257b3ab2f847b22a6a0a","last_reissued_at":"2026-07-05T06:27:59.179358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:27:59.179358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The degree and codegree threshold for generalized triangle and some trees covering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ran Gu, Shuaichao Wang","submitted_at":"2023-07-04T11:03:02Z","abstract_excerpt":"Given two $k$-uniform hypergraphs $F$ and $G$, we say that $G$ has an $F$-covering if for every vertex in $G$ there is a copy of $F$ covering it. For $1\\leq i\\leq k-1$, the minimum $i$-degree $\\delta_i(G)$ of $G$ is the minimum integer such that every $i$ vertices are contained in at least $\\delta_i(G)$ edges. Let $c_i(n,F)$ be the largest minimum $i$-degree among all $n$-vertex $k$-uniform hypergraphs that have no $F$-covering. In this paper, we consider the $F$-covering problem in $3$-uniform hypergraphs when $F$ is the generalized triangle $T$, where $T$ is a $3$-uniform hypergraph with the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01647","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.01647/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.01647","created_at":"2026-07-05T06:27:59.179418+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.01647v1","created_at":"2026-07-05T06:27:59.179418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01647","created_at":"2026-07-05T06:27:59.179418+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7KLIGKV4UGK","created_at":"2026-07-05T06:27:59.179418+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7KLIGKV4UGK4QAR","created_at":"2026-07-05T06:27:59.179418+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7KLIGKV","created_at":"2026-07-05T06:27:59.179418+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.05606","citing_title":"Perfect tilings of 3-graphs with the generalised triangle","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X7KLIGKV4UGK4QARAPQPAAHR5Q","json":"https://pith.science/pith/X7KLIGKV4UGK4QARAPQPAAHR5Q.json","graph_json":"https://pith.science/api/pith-number/X7KLIGKV4UGK4QARAPQPAAHR5Q/graph.json","events_json":"https://pith.science/api/pith-number/X7KLIGKV4UGK4QARAPQPAAHR5Q/events.json","paper":"https://pith.science/paper/X7KLIGKV"},"agent_actions":{"view_html":"https://pith.science/pith/X7KLIGKV4UGK4QARAPQPAAHR5Q","download_json":"https://pith.science/pith/X7KLIGKV4UGK4QARAPQPAAHR5Q.json","view_paper":"https://pith.science/paper/X7KLIGKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.01647&json=true","fetch_graph":"https://pith.science/api/pith-number/X7KLIGKV4UGK4QARAPQPAAHR5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/X7KLIGKV4UGK4QARAPQPAAHR5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7KLIGKV4UGK4QARAPQPAAHR5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7KLIGKV4UGK4QARAPQPAAHR5Q/action/storage_attestation","attest_author":"https://pith.science/pith/X7KLIGKV4UGK4QARAPQPAAHR5Q/action/author_attestation","sign_citation":"https://pith.science/pith/X7KLIGKV4UGK4QARAPQPAAHR5Q/action/citation_signature","submit_replication":"https://pith.science/pith/X7KLIGKV4UGK4QARAPQPAAHR5Q/action/replication_record"}},"created_at":"2026-07-05T06:27:59.179418+00:00","updated_at":"2026-07-05T06:27:59.179418+00:00"}