{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NZO2GS65ETVGZ4UJCG2VPEMDDI","short_pith_number":"pith:NZO2GS65","schema_version":"1.0","canonical_sha256":"6e5da34bdd24ea6cf28911b55791831a0244e69b94f33bc4aecf4dea5ab0c430","source":{"kind":"arxiv","id":"1908.02348","version":1},"attestation_state":"computed","paper":{"title":"Ramsey and Gallai-Ramsey numbers for stars with extra independent edges","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Ingo Schiermeyer, Yaping Mao, Zhao Wang","submitted_at":"2019-08-06T20:11:30Z","abstract_excerpt":"Given a graph $G$ and a positive integer $k$, define the \\emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$-edge coloring of $K_n$ contains either a rainbow (all different colored) triangle or a monochromatic copy of $G$. In this paper, we obtain general upper and lower bounds on the Gallai-Ramsey numbers for the graph $G = S_t^{r}$ obtained from a star of order $t$ by adding $r$ extra independent edges between leaves of the star so there are $r$ triangles and $t - 2r - 1$ pendent edges in $S_t^{r}$. We also prove some sharp results when $t = 2$."},"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":"1908.02348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-06T20:11:30Z","cross_cats_sorted":[],"title_canon_sha256":"f5a3e76f2af75715fd07eb6351c3e55ee9c825b5ebe25206980f14888901156b","abstract_canon_sha256":"6db712f02073450d795477388dd8a6bfbc12f84a003133a1447ce51215a65c82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:07.769453Z","signature_b64":"0bL6sLcwUG+1wI5DSxQn76m9/0ESbD7W8+NpcwJe0KgIo/n0NDgUI8ohaSxsXNrPgIMMb83p3Ygigq6NUwP0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e5da34bdd24ea6cf28911b55791831a0244e69b94f33bc4aecf4dea5ab0c430","last_reissued_at":"2026-07-04T23:52:07.769034Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:07.769034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramsey and Gallai-Ramsey numbers for stars with extra independent edges","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Ingo Schiermeyer, Yaping Mao, Zhao Wang","submitted_at":"2019-08-06T20:11:30Z","abstract_excerpt":"Given a graph $G$ and a positive integer $k$, define the \\emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$-edge coloring of $K_n$ contains either a rainbow (all different colored) triangle or a monochromatic copy of $G$. In this paper, we obtain general upper and lower bounds on the Gallai-Ramsey numbers for the graph $G = S_t^{r}$ obtained from a star of order $t$ by adding $r$ extra independent edges between leaves of the star so there are $r$ triangles and $t - 2r - 1$ pendent edges in $S_t^{r}$. We also prove some sharp results when $t = 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02348","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02348/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.02348","created_at":"2026-07-04T23:52:07.769090+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02348v1","created_at":"2026-07-04T23:52:07.769090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02348","created_at":"2026-07-04T23:52:07.769090+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZO2GS65ETVG","created_at":"2026-07-04T23:52:07.769090+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZO2GS65ETVGZ4UJ","created_at":"2026-07-04T23:52:07.769090+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZO2GS65","created_at":"2026-07-04T23:52:07.769090+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/NZO2GS65ETVGZ4UJCG2VPEMDDI","json":"https://pith.science/pith/NZO2GS65ETVGZ4UJCG2VPEMDDI.json","graph_json":"https://pith.science/api/pith-number/NZO2GS65ETVGZ4UJCG2VPEMDDI/graph.json","events_json":"https://pith.science/api/pith-number/NZO2GS65ETVGZ4UJCG2VPEMDDI/events.json","paper":"https://pith.science/paper/NZO2GS65"},"agent_actions":{"view_html":"https://pith.science/pith/NZO2GS65ETVGZ4UJCG2VPEMDDI","download_json":"https://pith.science/pith/NZO2GS65ETVGZ4UJCG2VPEMDDI.json","view_paper":"https://pith.science/paper/NZO2GS65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02348&json=true","fetch_graph":"https://pith.science/api/pith-number/NZO2GS65ETVGZ4UJCG2VPEMDDI/graph.json","fetch_events":"https://pith.science/api/pith-number/NZO2GS65ETVGZ4UJCG2VPEMDDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZO2GS65ETVGZ4UJCG2VPEMDDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZO2GS65ETVGZ4UJCG2VPEMDDI/action/storage_attestation","attest_author":"https://pith.science/pith/NZO2GS65ETVGZ4UJCG2VPEMDDI/action/author_attestation","sign_citation":"https://pith.science/pith/NZO2GS65ETVGZ4UJCG2VPEMDDI/action/citation_signature","submit_replication":"https://pith.science/pith/NZO2GS65ETVGZ4UJCG2VPEMDDI/action/replication_record"}},"created_at":"2026-07-04T23:52:07.769090+00:00","updated_at":"2026-07-04T23:52:07.769090+00:00"}