{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:42C6UZQARXTCRVLY3M4BQ6OPKP","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":"c42e03f7109dc7d06075a67493264336550d7bbc8555757c2a11486b235b7222","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-13T23:59:39Z","title_canon_sha256":"650078dd8663bff5e592693bc249170099ad6afcf29d82f8cc47ef09deeb451e"},"schema_version":"1.0","source":{"id":"2507.09832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09832","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09832v1","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09832","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"pith_short_12","alias_value":"42C6UZQARXTC","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"pith_short_16","alias_value":"42C6UZQARXTCRVLY","created_at":"2026-07-05T11:36:40Z"},{"alias_kind":"pith_short_8","alias_value":"42C6UZQA","created_at":"2026-07-05T11:36:40Z"}],"graph_snapshots":[{"event_id":"sha256:ca0a8b88de314ffce7d3bee7e4f9f2354ddb72f629a83e5b30a0aefab0e0ca89","target":"graph","created_at":"2026-07-05T11:36:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.09832/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a connected graph of order $n$, $F_k$ be a fan consisting of $k$ triangles sharing a common vertex, and $tF_k$ be $t$ vertex-disjoint copies of $F_k$. Brennan (2017) showed the Ramsey number $r(G,F_k)=2n-1$ for $G$ being a unicyclic graph for $n \\geq k^2-k+1$ and $k\\ge 18$, and asked the threshold $c(n)$ for which $r(G,F_k) \\geq 2n$ holds for any $G$ containing at least $c(n)$ cycles and $n$ being large. In this paper, we consider fan-goodness of general sparse graphs and show that if $G$ has at most $n(1+\\epsilon(k))$ edges, where $\\epsilon(k)$ is a constant depending on $k$, then ","authors_text":"Ting Huang, Yanbo Zhang, Yaojun Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-13T23:59:39Z","title":"Fan-goodness of sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09832","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:bb22dbdc99ca4147e8be9db6882c5ff36ad1e2971af184b9aea095bcae7be689","target":"record","created_at":"2026-07-05T11:36:40Z","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":"c42e03f7109dc7d06075a67493264336550d7bbc8555757c2a11486b235b7222","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-13T23:59:39Z","title_canon_sha256":"650078dd8663bff5e592693bc249170099ad6afcf29d82f8cc47ef09deeb451e"},"schema_version":"1.0","source":{"id":"2507.09832","kind":"arxiv","version":1}},"canonical_sha256":"e685ea66008de628d578db381879cf53ff626bd492df794b6c2c5ff4f42235da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e685ea66008de628d578db381879cf53ff626bd492df794b6c2c5ff4f42235da","first_computed_at":"2026-07-05T11:36:40.487326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:40.487326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7/7jbQV5QSk/UCmnHFfteWl88u78ZgUp8QBcKt94K6GIBuEC8c4jeuGLXT49Ss/EB2FM0fvTjWIJQE6GId8iCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:40.487795Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.09832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb22dbdc99ca4147e8be9db6882c5ff36ad1e2971af184b9aea095bcae7be689","sha256:ca0a8b88de314ffce7d3bee7e4f9f2354ddb72f629a83e5b30a0aefab0e0ca89"],"state_sha256":"a32df52ed6e4ce103791d824383d9a3a0e1df13a1185e8eccb2cc9a7e7e9b465"}