{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UDSA44ZXROG2C3DEUNAWEVBKFU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a16c507b6615b4d5c02828694e8073f74b972286358e6eab3b082248493cbcea","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T09:09:38Z","title_canon_sha256":"c0c1fa39033474403b02a7f8cbff59045ec87bb77a9057eba6e441c394b53763"},"schema_version":"1.0","source":{"id":"1901.09560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09560","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09560v1","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09560","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"pith_short_12","alias_value":"UDSA44ZXROG2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UDSA44ZXROG2C3DE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UDSA44ZX","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:01f0383a69403930792f3f29a193c79fd34458a509f8f2afb78a613501da6b6e","target":"graph","created_at":"2026-05-17T23:55:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We investigate a covering problem in $3$-uniform hypergraphs ($3$-graphs): given a $3$-graph $F$, what is $c_1(n,F)$, the least integer $d$ such that if $G$ is an $n$-vertex $3$-graph with minimum vertex degree $\\delta_1(G)>d$ then every vertex of $G$ is contained in a copy of $F$ in $G$ ?\n  We asymptotically determine $c_1(n,F)$ when $F$ is the generalised triangle $K_4^{(3)-}$, and we give close to optimal bounds in the case where $F$ is the tetrahedron $K_4^{(3)}$ (the complete $3$-graph on $4$ vertices).\n  This latter problem turns out to be a special instance of the following problem for ","authors_text":"Klas Markstr\\\"om, Victor Falgas--Ravry, Yi Zhao","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T09:09:38Z","title":"Triangle-degrees in graphs and tetrahedron coverings in 3-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09560","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9b2e28813cf5e23c0272138a0f932a636c08d44654a5de664673cc6291625dee","target":"record","created_at":"2026-05-17T23:55:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a16c507b6615b4d5c02828694e8073f74b972286358e6eab3b082248493cbcea","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T09:09:38Z","title_canon_sha256":"c0c1fa39033474403b02a7f8cbff59045ec87bb77a9057eba6e441c394b53763"},"schema_version":"1.0","source":{"id":"1901.09560","kind":"arxiv","version":1}},"canonical_sha256":"a0e40e73378b8da16c64a34162542a2d35edf082f2aa565adc919a3e9da1526b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0e40e73378b8da16c64a34162542a2d35edf082f2aa565adc919a3e9da1526b","first_computed_at":"2026-05-17T23:55:24.477098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:24.477098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Urh8SyRaHc4Jwh+7zZ6Wdn+26lu78ssE6E5p2x/API54X71YfhjtA39Ln6Y+mdrg/InP9jD4KZqFIHbLMdtUAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:24.477549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b2e28813cf5e23c0272138a0f932a636c08d44654a5de664673cc6291625dee","sha256:01f0383a69403930792f3f29a193c79fd34458a509f8f2afb78a613501da6b6e"],"state_sha256":"3bb6a62869d60a72b821bb0304230d9fc82c9b33c59cd0d3ba2ada4f17a51034"}