{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3JDYJOT5CBSAOEGFDVL5P5K5CE","short_pith_number":"pith:3JDYJOT5","schema_version":"1.0","canonical_sha256":"da4784ba7d10640710c51d57d7f55d11390a3d1b0afacf19dd8beab5649c4100","source":{"kind":"arxiv","id":"1710.05731","version":1},"attestation_state":"computed","paper":{"title":"Trees and $n$-Good Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Penland, Mark Budden","submitted_at":"2017-10-16T14:28:19Z","abstract_excerpt":"Trees fill many extremal roles in graph theory, being minimally connected and serving a critical role in the definition of $n$-good graphs. In this article, we consider the generalization of trees to the setting of $r$-uniform hypergraphs and how one may extend the notion of $n$-good graphs to this setting. We prove numerous bounds for $r$-uniform hypergraph Ramsey numbers involving trees and complete hypergraphs and show that in the $3$-uniform case, all trees are $n$-good when $n$ is odd or $n$ falls into specified even cases."},"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":"1710.05731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-16T14:28:19Z","cross_cats_sorted":[],"title_canon_sha256":"9bf0a862d4712a2eaea6c554ca46b2b24ef490a7d324e8ed575871c365dc7b35","abstract_canon_sha256":"ff731ab3d238ba1656344842eeb0ddd39ab02287cd4ddb58e05306e410ca7171"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:48.367198Z","signature_b64":"hYFtU4xagDfEQwSzVdPK/veg8gJ39Icl5EaQDatSaDq5i5IZ6EwtqyWZgck9JsLMmr34x0lcKYIoro5SMlFpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da4784ba7d10640710c51d57d7f55d11390a3d1b0afacf19dd8beab5649c4100","last_reissued_at":"2026-05-18T00:32:48.366490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:48.366490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trees and $n$-Good Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Penland, Mark Budden","submitted_at":"2017-10-16T14:28:19Z","abstract_excerpt":"Trees fill many extremal roles in graph theory, being minimally connected and serving a critical role in the definition of $n$-good graphs. In this article, we consider the generalization of trees to the setting of $r$-uniform hypergraphs and how one may extend the notion of $n$-good graphs to this setting. We prove numerous bounds for $r$-uniform hypergraph Ramsey numbers involving trees and complete hypergraphs and show that in the $3$-uniform case, all trees are $n$-good when $n$ is odd or $n$ falls into specified even cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05731","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":"1710.05731","created_at":"2026-05-18T00:32:48.366589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05731v1","created_at":"2026-05-18T00:32:48.366589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05731","created_at":"2026-05-18T00:32:48.366589+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JDYJOT5CBSA","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JDYJOT5CBSAOEGF","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JDYJOT5","created_at":"2026-05-18T12:30:58.224056+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/3JDYJOT5CBSAOEGFDVL5P5K5CE","json":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE.json","graph_json":"https://pith.science/api/pith-number/3JDYJOT5CBSAOEGFDVL5P5K5CE/graph.json","events_json":"https://pith.science/api/pith-number/3JDYJOT5CBSAOEGFDVL5P5K5CE/events.json","paper":"https://pith.science/paper/3JDYJOT5"},"agent_actions":{"view_html":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE","download_json":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE.json","view_paper":"https://pith.science/paper/3JDYJOT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05731&json=true","fetch_graph":"https://pith.science/api/pith-number/3JDYJOT5CBSAOEGFDVL5P5K5CE/graph.json","fetch_events":"https://pith.science/api/pith-number/3JDYJOT5CBSAOEGFDVL5P5K5CE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE/action/storage_attestation","attest_author":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE/action/author_attestation","sign_citation":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE/action/citation_signature","submit_replication":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE/action/replication_record"}},"created_at":"2026-05-18T00:32:48.366589+00:00","updated_at":"2026-05-18T00:32:48.366589+00:00"}