{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ULYN2HKCZY3MHEALNMQXNZUKC3","short_pith_number":"pith:ULYN2HKC","schema_version":"1.0","canonical_sha256":"a2f0dd1d42ce36c3900b6b2176e68a16faa9159393fa77a9a0f2f67d3061786d","source":{"kind":"arxiv","id":"1610.06378","version":2},"attestation_state":"computed","paper":{"title":"Subgraphs with large minimum $\\ell$-degree in hypergraphs where almost all $\\ell$-degrees are large","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Victor Falgas-Ravry","submitted_at":"2016-10-20T12:28:03Z","abstract_excerpt":"Let $G$ be an $r$-uniform hypergraph on $n$ vertices such that all but at most $\\varepsilon \\binom{n}{\\ell}$ $\\ell$-subsets of vertices have degree at least $p \\binom{n-\\ell}{r-\\ell}$.\n  We show that $G$ contains a large subgraph with high minimum $\\ell$-degree."},"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":"1610.06378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-20T12:28:03Z","cross_cats_sorted":[],"title_canon_sha256":"15d6ae80fbeda92782905a08d74ba7f2d0835792a84db8fc7cd1adc45ca576c1","abstract_canon_sha256":"365cb0714510b6f0a0da97e39fda0c389d871c726fbcb1ba64bfcc0d0c3ad692"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:32.065015Z","signature_b64":"GcRSYasv/U6c2HJKErWfRtnPszsa06pNNH4Lhhf0tL64aJE53SZTv+TqOS2gQzDDZhPrxKMcU+51nKCytnTkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2f0dd1d42ce36c3900b6b2176e68a16faa9159393fa77a9a0f2f67d3061786d","last_reissued_at":"2026-05-18T00:18:32.064627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:32.064627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subgraphs with large minimum $\\ell$-degree in hypergraphs where almost all $\\ell$-degrees are large","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Victor Falgas-Ravry","submitted_at":"2016-10-20T12:28:03Z","abstract_excerpt":"Let $G$ be an $r$-uniform hypergraph on $n$ vertices such that all but at most $\\varepsilon \\binom{n}{\\ell}$ $\\ell$-subsets of vertices have degree at least $p \\binom{n-\\ell}{r-\\ell}$.\n  We show that $G$ contains a large subgraph with high minimum $\\ell$-degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06378","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.06378","created_at":"2026-05-18T00:18:32.064688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06378v2","created_at":"2026-05-18T00:18:32.064688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06378","created_at":"2026-05-18T00:18:32.064688+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULYN2HKCZY3M","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULYN2HKCZY3MHEAL","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULYN2HKC","created_at":"2026-05-18T12:30:46.583412+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/ULYN2HKCZY3MHEALNMQXNZUKC3","json":"https://pith.science/pith/ULYN2HKCZY3MHEALNMQXNZUKC3.json","graph_json":"https://pith.science/api/pith-number/ULYN2HKCZY3MHEALNMQXNZUKC3/graph.json","events_json":"https://pith.science/api/pith-number/ULYN2HKCZY3MHEALNMQXNZUKC3/events.json","paper":"https://pith.science/paper/ULYN2HKC"},"agent_actions":{"view_html":"https://pith.science/pith/ULYN2HKCZY3MHEALNMQXNZUKC3","download_json":"https://pith.science/pith/ULYN2HKCZY3MHEALNMQXNZUKC3.json","view_paper":"https://pith.science/paper/ULYN2HKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06378&json=true","fetch_graph":"https://pith.science/api/pith-number/ULYN2HKCZY3MHEALNMQXNZUKC3/graph.json","fetch_events":"https://pith.science/api/pith-number/ULYN2HKCZY3MHEALNMQXNZUKC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULYN2HKCZY3MHEALNMQXNZUKC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULYN2HKCZY3MHEALNMQXNZUKC3/action/storage_attestation","attest_author":"https://pith.science/pith/ULYN2HKCZY3MHEALNMQXNZUKC3/action/author_attestation","sign_citation":"https://pith.science/pith/ULYN2HKCZY3MHEALNMQXNZUKC3/action/citation_signature","submit_replication":"https://pith.science/pith/ULYN2HKCZY3MHEALNMQXNZUKC3/action/replication_record"}},"created_at":"2026-05-18T00:18:32.064688+00:00","updated_at":"2026-05-18T00:18:32.064688+00:00"}