{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZATTQXYB5EVGZLWBCXWVGYW3NM","short_pith_number":"pith:ZATTQXYB","schema_version":"1.0","canonical_sha256":"c827385f01e92a6caec115ed5362db6b35f7bdca571ea73fa85009e071481396","source":{"kind":"arxiv","id":"2411.14889","version":2},"attestation_state":"computed","paper":{"title":"Spreading in claw-free cubic graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Jaka Hed\\v{z}et, Michael A. Henning","submitted_at":"2024-11-22T12:16:53Z","abstract_excerpt":"Let $p \\in \\mathbb{N}$ and $q \\in \\mathbb{N} \\cup \\lbrace \\infty \\rbrace$. We study a dynamic coloring of the vertices of a graph $G$ that starts with an initial subset $S$ of blue vertices, with all remaining vertices colored white. If a white vertex~$v$ has at least~$p$ blue neighbors and at least one of these blue neighbors of~$v$ has at most~$q$ white neighbors, then by the spreading color change rule the vertex~$v$ is recolored blue. The initial set $S$ of blue vertices is a $(p,q)$-spreading set for $G$ if by repeatedly applying the spreading color change rule all the vertices of $G$ are"},"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":"2411.14889","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-22T12:16:53Z","cross_cats_sorted":[],"title_canon_sha256":"5ffed888baea5047359e40b5d6bc08e892b346fb5e141ab7d9021f43d2455a7c","abstract_canon_sha256":"258795fae528528cd67a0d1667552c9429c8d6aba76abe18fc9c87af32883fd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:37.940740Z","signature_b64":"7cgXN7Baz5+G0JHzzxEkyRG57aY5o0cFuO5NEz81mUjPjDTffLA874+UkkG5gPCc5icvNK4oPcsttOa0u/rICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c827385f01e92a6caec115ed5362db6b35f7bdca571ea73fa85009e071481396","last_reissued_at":"2026-07-05T12:02:37.940189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:37.940189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spreading in claw-free cubic graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Jaka Hed\\v{z}et, Michael A. Henning","submitted_at":"2024-11-22T12:16:53Z","abstract_excerpt":"Let $p \\in \\mathbb{N}$ and $q \\in \\mathbb{N} \\cup \\lbrace \\infty \\rbrace$. We study a dynamic coloring of the vertices of a graph $G$ that starts with an initial subset $S$ of blue vertices, with all remaining vertices colored white. If a white vertex~$v$ has at least~$p$ blue neighbors and at least one of these blue neighbors of~$v$ has at most~$q$ white neighbors, then by the spreading color change rule the vertex~$v$ is recolored blue. The initial set $S$ of blue vertices is a $(p,q)$-spreading set for $G$ if by repeatedly applying the spreading color change rule all the vertices of $G$ are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14889","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14889/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":"2411.14889","created_at":"2026-07-05T12:02:37.940266+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14889v2","created_at":"2026-07-05T12:02:37.940266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14889","created_at":"2026-07-05T12:02:37.940266+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZATTQXYB5EVG","created_at":"2026-07-05T12:02:37.940266+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZATTQXYB5EVGZLWB","created_at":"2026-07-05T12:02:37.940266+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZATTQXYB","created_at":"2026-07-05T12:02:37.940266+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/ZATTQXYB5EVGZLWBCXWVGYW3NM","json":"https://pith.science/pith/ZATTQXYB5EVGZLWBCXWVGYW3NM.json","graph_json":"https://pith.science/api/pith-number/ZATTQXYB5EVGZLWBCXWVGYW3NM/graph.json","events_json":"https://pith.science/api/pith-number/ZATTQXYB5EVGZLWBCXWVGYW3NM/events.json","paper":"https://pith.science/paper/ZATTQXYB"},"agent_actions":{"view_html":"https://pith.science/pith/ZATTQXYB5EVGZLWBCXWVGYW3NM","download_json":"https://pith.science/pith/ZATTQXYB5EVGZLWBCXWVGYW3NM.json","view_paper":"https://pith.science/paper/ZATTQXYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14889&json=true","fetch_graph":"https://pith.science/api/pith-number/ZATTQXYB5EVGZLWBCXWVGYW3NM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZATTQXYB5EVGZLWBCXWVGYW3NM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZATTQXYB5EVGZLWBCXWVGYW3NM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZATTQXYB5EVGZLWBCXWVGYW3NM/action/storage_attestation","attest_author":"https://pith.science/pith/ZATTQXYB5EVGZLWBCXWVGYW3NM/action/author_attestation","sign_citation":"https://pith.science/pith/ZATTQXYB5EVGZLWBCXWVGYW3NM/action/citation_signature","submit_replication":"https://pith.science/pith/ZATTQXYB5EVGZLWBCXWVGYW3NM/action/replication_record"}},"created_at":"2026-07-05T12:02:37.940266+00:00","updated_at":"2026-07-05T12:02:37.940266+00:00"}