{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BU4WY2EYOHBU3M7CZF74NDZIA5","short_pith_number":"pith:BU4WY2EY","schema_version":"1.0","canonical_sha256":"0d396c689871c34db3e2c97fc68f28074c1a12784bafa2ee2e109dd2d90ad69f","source":{"kind":"arxiv","id":"1607.07789","version":1},"attestation_state":"computed","paper":{"title":"Triangle-tilings in graphs without large independent sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew McDowell, J\\'ozsef Balogh, Richard Mycroft, Theodore Molla","submitted_at":"2016-07-26T16:38:50Z","abstract_excerpt":"We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an $n$-vertex graph $G$ with sublinear independence number. In this setting, we show that if $\\delta(G) \\ge n/3 + o(n)$ then $G$ has a triangle-tiling covering all but at most four vertices. Also, for every $r \\ge 5$, we asymptotically determine the minimum degree threshold for a perfect triangle-tiling under the additional assumptions that $G$ is $K_r$-free and $n$ is divisible by $3$."},"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":"1607.07789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-26T16:38:50Z","cross_cats_sorted":[],"title_canon_sha256":"c204dc6b55ce840456bd7b72eabc72e02203f5295b9a8137f436ac36d8d2c126","abstract_canon_sha256":"d20844b5d89e64c23e47dfe82d7fa895b94a301a5d50c1dba5aaf1f3ead96b83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:25.231543Z","signature_b64":"oINcN6IxUs9Mz4jRsozAE9IMdBvqHngZZ1YhRbIC4qryb1xURsoZdRrma6qvGe9nftcEvDodwoOkrpLOMmbZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d396c689871c34db3e2c97fc68f28074c1a12784bafa2ee2e109dd2d90ad69f","last_reissued_at":"2026-05-18T01:10:25.230650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:25.230650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangle-tilings in graphs without large independent sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew McDowell, J\\'ozsef Balogh, Richard Mycroft, Theodore Molla","submitted_at":"2016-07-26T16:38:50Z","abstract_excerpt":"We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an $n$-vertex graph $G$ with sublinear independence number. In this setting, we show that if $\\delta(G) \\ge n/3 + o(n)$ then $G$ has a triangle-tiling covering all but at most four vertices. Also, for every $r \\ge 5$, we asymptotically determine the minimum degree threshold for a perfect triangle-tiling under the additional assumptions that $G$ is $K_r$-free and $n$ is divisible by $3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07789","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":"1607.07789","created_at":"2026-05-18T01:10:25.230758+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07789v1","created_at":"2026-05-18T01:10:25.230758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07789","created_at":"2026-05-18T01:10:25.230758+00:00"},{"alias_kind":"pith_short_12","alias_value":"BU4WY2EYOHBU","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BU4WY2EYOHBU3M7C","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BU4WY2EY","created_at":"2026-05-18T12:30:09.641336+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/BU4WY2EYOHBU3M7CZF74NDZIA5","json":"https://pith.science/pith/BU4WY2EYOHBU3M7CZF74NDZIA5.json","graph_json":"https://pith.science/api/pith-number/BU4WY2EYOHBU3M7CZF74NDZIA5/graph.json","events_json":"https://pith.science/api/pith-number/BU4WY2EYOHBU3M7CZF74NDZIA5/events.json","paper":"https://pith.science/paper/BU4WY2EY"},"agent_actions":{"view_html":"https://pith.science/pith/BU4WY2EYOHBU3M7CZF74NDZIA5","download_json":"https://pith.science/pith/BU4WY2EYOHBU3M7CZF74NDZIA5.json","view_paper":"https://pith.science/paper/BU4WY2EY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07789&json=true","fetch_graph":"https://pith.science/api/pith-number/BU4WY2EYOHBU3M7CZF74NDZIA5/graph.json","fetch_events":"https://pith.science/api/pith-number/BU4WY2EYOHBU3M7CZF74NDZIA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BU4WY2EYOHBU3M7CZF74NDZIA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BU4WY2EYOHBU3M7CZF74NDZIA5/action/storage_attestation","attest_author":"https://pith.science/pith/BU4WY2EYOHBU3M7CZF74NDZIA5/action/author_attestation","sign_citation":"https://pith.science/pith/BU4WY2EYOHBU3M7CZF74NDZIA5/action/citation_signature","submit_replication":"https://pith.science/pith/BU4WY2EYOHBU3M7CZF74NDZIA5/action/replication_record"}},"created_at":"2026-05-18T01:10:25.230758+00:00","updated_at":"2026-05-18T01:10:25.230758+00:00"}