{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZNYBSHJFMYWM6C7LW6AIIY7TEH","short_pith_number":"pith:ZNYBSHJF","schema_version":"1.0","canonical_sha256":"cb70191d25662ccf0bebb7808463f321ef155c96a0dec4b52014a4c245166923","source":{"kind":"arxiv","id":"1804.08191","version":2},"attestation_state":"computed","paper":{"title":"Embedding Hypertrees into Steiner Triple Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bradley Elliott, Vojt\\v{e}ch R\\\"odl","submitted_at":"2018-04-22T23:23:22Z","abstract_excerpt":"In this paper we are interested in the following question: Given an arbitrary Steiner triple system $S$ on $m$ vertices and any 3-uniform hypertree $T$ on $n$ vertices, is it necessary that $S$ contains $T$ as a subgraph provided $m \\geq (1+\\mu)n$? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive."},"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":"1804.08191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-22T23:23:22Z","cross_cats_sorted":[],"title_canon_sha256":"6c2113b8d7597f0120d500a5d0940e9ec338625a8d71a102ef32bd014ce9c65e","abstract_canon_sha256":"a8aef3191bfebdfe670f2d73a61b74ddae7e24c83a07870ce15f067003f1d927"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:19.756207Z","signature_b64":"CsnSOIhvTKx65uBlYYEml7SfjDczCKBCZxCWkdB/opgaIKBiS5grv8TjoLBLf6B35+zbGWk86AgSQ4Lo8rjSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb70191d25662ccf0bebb7808463f321ef155c96a0dec4b52014a4c245166923","last_reissued_at":"2026-05-17T23:46:19.755434Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:19.755434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding Hypertrees into Steiner Triple Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bradley Elliott, Vojt\\v{e}ch R\\\"odl","submitted_at":"2018-04-22T23:23:22Z","abstract_excerpt":"In this paper we are interested in the following question: Given an arbitrary Steiner triple system $S$ on $m$ vertices and any 3-uniform hypertree $T$ on $n$ vertices, is it necessary that $S$ contains $T$ as a subgraph provided $m \\geq (1+\\mu)n$? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08191","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":"1804.08191","created_at":"2026-05-17T23:46:19.755561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08191v2","created_at":"2026-05-17T23:46:19.755561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08191","created_at":"2026-05-17T23:46:19.755561+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNYBSHJFMYWM","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNYBSHJFMYWM6C7L","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNYBSHJF","created_at":"2026-05-18T12:33:07.085635+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/ZNYBSHJFMYWM6C7LW6AIIY7TEH","json":"https://pith.science/pith/ZNYBSHJFMYWM6C7LW6AIIY7TEH.json","graph_json":"https://pith.science/api/pith-number/ZNYBSHJFMYWM6C7LW6AIIY7TEH/graph.json","events_json":"https://pith.science/api/pith-number/ZNYBSHJFMYWM6C7LW6AIIY7TEH/events.json","paper":"https://pith.science/paper/ZNYBSHJF"},"agent_actions":{"view_html":"https://pith.science/pith/ZNYBSHJFMYWM6C7LW6AIIY7TEH","download_json":"https://pith.science/pith/ZNYBSHJFMYWM6C7LW6AIIY7TEH.json","view_paper":"https://pith.science/paper/ZNYBSHJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08191&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNYBSHJFMYWM6C7LW6AIIY7TEH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNYBSHJFMYWM6C7LW6AIIY7TEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNYBSHJFMYWM6C7LW6AIIY7TEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNYBSHJFMYWM6C7LW6AIIY7TEH/action/storage_attestation","attest_author":"https://pith.science/pith/ZNYBSHJFMYWM6C7LW6AIIY7TEH/action/author_attestation","sign_citation":"https://pith.science/pith/ZNYBSHJFMYWM6C7LW6AIIY7TEH/action/citation_signature","submit_replication":"https://pith.science/pith/ZNYBSHJFMYWM6C7LW6AIIY7TEH/action/replication_record"}},"created_at":"2026-05-17T23:46:19.755561+00:00","updated_at":"2026-05-17T23:46:19.755561+00:00"}