{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3JDYJOT5CBSAOEGFDVL5P5K5CE","short_pith_number":"pith:3JDYJOT5","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"},"canonical_sha256":"da4784ba7d10640710c51d57d7f55d11390a3d1b0afacf19dd8beab5649c4100","source":{"kind":"arxiv","id":"1710.05731","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05731","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05731v1","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05731","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"3JDYJOT5CBSA","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3JDYJOT5CBSAOEGF","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3JDYJOT5","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3JDYJOT5CBSAOEGFDVL5P5K5CE","target":"record","payload":{"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"},"canonical_sha256":"da4784ba7d10640710c51d57d7f55d11390a3d1b0afacf19dd8beab5649c4100","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"},"source_kind":"arxiv","source_id":"1710.05731","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bZwD0WsZcniWnR/R2mdA8bOu7IpqTJDcF5iG4E5F3YnRdiiTxGe4+EyC3H+95k7ILg6KakXD0xUxQwbKXj8pBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:58:00.887302Z"},"content_sha256":"429fc338fae70e75fa3bef50a3497d183d56a7e78f5bbe029e9523d10a581e5e","schema_version":"1.0","event_id":"sha256:429fc338fae70e75fa3bef50a3497d183d56a7e78f5bbe029e9523d10a581e5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3JDYJOT5CBSAOEGFDVL5P5K5CE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5BNivpHJMPWS3+iX2VV9820Ix81OZTlZ8gJwoVQuJFzo9em8TNeKoJe69mYXAWLMkHJn3vF+u/RC1ScguBFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:58:00.887685Z"},"content_sha256":"a7e0615e83e72ba1da9e68899e1b0710163dbfccd15484a1f953011b08fb7ab4","schema_version":"1.0","event_id":"sha256:a7e0615e83e72ba1da9e68899e1b0710163dbfccd15484a1f953011b08fb7ab4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE/bundle.json","state_url":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T02:58:00Z","links":{"resolver":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE","bundle":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE/bundle.json","state":"https://pith.science/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JDYJOT5CBSAOEGFDVL5P5K5CE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3JDYJOT5CBSAOEGFDVL5P5K5CE","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":"ff731ab3d238ba1656344842eeb0ddd39ab02287cd4ddb58e05306e410ca7171","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-16T14:28:19Z","title_canon_sha256":"9bf0a862d4712a2eaea6c554ca46b2b24ef490a7d324e8ed575871c365dc7b35"},"schema_version":"1.0","source":{"id":"1710.05731","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05731","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05731v1","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05731","created_at":"2026-05-18T00:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"3JDYJOT5CBSA","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3JDYJOT5CBSAOEGF","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3JDYJOT5","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:a7e0615e83e72ba1da9e68899e1b0710163dbfccd15484a1f953011b08fb7ab4","target":"graph","created_at":"2026-05-18T00:32:48Z","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":"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.","authors_text":"Andrew Penland, Mark Budden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-16T14:28:19Z","title":"Trees and $n$-Good Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05731","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:429fc338fae70e75fa3bef50a3497d183d56a7e78f5bbe029e9523d10a581e5e","target":"record","created_at":"2026-05-18T00:32:48Z","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":"ff731ab3d238ba1656344842eeb0ddd39ab02287cd4ddb58e05306e410ca7171","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-16T14:28:19Z","title_canon_sha256":"9bf0a862d4712a2eaea6c554ca46b2b24ef490a7d324e8ed575871c365dc7b35"},"schema_version":"1.0","source":{"id":"1710.05731","kind":"arxiv","version":1}},"canonical_sha256":"da4784ba7d10640710c51d57d7f55d11390a3d1b0afacf19dd8beab5649c4100","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da4784ba7d10640710c51d57d7f55d11390a3d1b0afacf19dd8beab5649c4100","first_computed_at":"2026-05-18T00:32:48.366490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:48.366490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hYFtU4xagDfEQwSzVdPK/veg8gJ39Icl5EaQDatSaDq5i5IZ6EwtqyWZgck9JsLMmr34x0lcKYIoro5SMlFpDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:48.367198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05731","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:429fc338fae70e75fa3bef50a3497d183d56a7e78f5bbe029e9523d10a581e5e","sha256:a7e0615e83e72ba1da9e68899e1b0710163dbfccd15484a1f953011b08fb7ab4"],"state_sha256":"125a0c585ae041d19aa9dc59fef0fbc8e93a222bc7136fa6631c8643993f93e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AX8Cp8o1XQtZqit5RJSfvCTX0HAYNNlLjWK9CxgcbAW4rnMZW5ZYc66Sc+GdVQr3eJjXSi4AHvBi7Yi25v+tDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T02:58:00.889528Z","bundle_sha256":"db134b3cdfc30c016bfa0604065f6b8a60e305e35e18231834810e1e8e3a051f"}}