{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:N4JXJVDICDBTX3ULTITVRP2OF3","short_pith_number":"pith:N4JXJVDI","canonical_record":{"source":{"id":"2605.21817","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T23:38:08Z","cross_cats_sorted":[],"title_canon_sha256":"514e3ed1d37b478fdd989908d640fd0a9591454f9710be7b11bc11d34170d825","abstract_canon_sha256":"1aac11ded0c05237123afa382f9bb7ac38a99cf0d31865501ed69d94fe84cc95"},"schema_version":"1.0"},"canonical_sha256":"6f1374d46810c33bee8b9a2758bf4e2ed19aee8c7e1eac75226e46ff5078e312","source":{"kind":"arxiv","id":"2605.21817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21817","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21817v1","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21817","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"N4JXJVDICDBT","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_16","alias_value":"N4JXJVDICDBTX3UL","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_8","alias_value":"N4JXJVDI","created_at":"2026-05-22T01:04:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:N4JXJVDICDBTX3ULTITVRP2OF3","target":"record","payload":{"canonical_record":{"source":{"id":"2605.21817","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T23:38:08Z","cross_cats_sorted":[],"title_canon_sha256":"514e3ed1d37b478fdd989908d640fd0a9591454f9710be7b11bc11d34170d825","abstract_canon_sha256":"1aac11ded0c05237123afa382f9bb7ac38a99cf0d31865501ed69d94fe84cc95"},"schema_version":"1.0"},"canonical_sha256":"6f1374d46810c33bee8b9a2758bf4e2ed19aee8c7e1eac75226e46ff5078e312","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:09.183857Z","signature_b64":"1cgtnE1bWzNI+ZfomTk6CImvVSXTfDTqQuhIsHzLpBAs4sGi0GS02zzCM0oIrxY+b/yzQKD1wIRePut2F+NOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1374d46810c33bee8b9a2758bf4e2ed19aee8c7e1eac75226e46ff5078e312","last_reissued_at":"2026-05-22T01:04:09.182823Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:09.182823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.21817","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-22T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KLb1xPNSkYDV2OnOwBOSK5OCz/Iox3LrtE4L4ExOTp2t9+hgZkH4zL0YWoxM/cXBHq0olS5pDzi5P3qaolvhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:27:48.657762Z"},"content_sha256":"3a794da83b316e0d682b2d3177f51187ad7da24c14108330d6c259b982118c18","schema_version":"1.0","event_id":"sha256:3a794da83b316e0d682b2d3177f51187ad7da24c14108330d6c259b982118c18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:N4JXJVDICDBTX3ULTITVRP2OF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear upper bound on the $\\mathbb{Z}_p$-Ramsey number of graphs with sufficiently large $2$-packing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Simmons, Emily Heath","submitted_at":"2026-05-20T23:38:08Z","abstract_excerpt":"Given a positive integer $k$ and graph $G$, the $\\mathbb{Z}_k$-Ramsey number $R(G,\\mathbb{Z}_k)$ is the least $N$ (if it exists) such that every coloring $f:E(K_N)\\rightarrow \\mathbb{Z}_k$ contains a copy $G'$ of $G$ such that $\\sum_{e\\in E(G')}f(e)=0$. Motivated by a question of Caro and Mifsud, we study the $\\mathbb{Z}_k$-Ramsey number of graphs with a sufficiently large 2-packing, i.e. a set of vertices $S\\subseteq V(G)$ such that $N[u]\\cap N[v]=\\emptyset$ for all distinct $u,v\\in S$. In particular, we prove that $R(G,\\mathbb{Z}_p)\\leq n+6p-9$ for all $n$-vertex graphs $G$ and all primes $p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21817","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/2605.21817/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"},"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-22T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v43nn/Q2Ndx1tNeTmflVzNQUNqPgeGWTA47d0kQoA3prZDKrkcr1/nzvqQEogW185TN71/4EYuwZIukd8tEZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:27:48.658280Z"},"content_sha256":"7273a1ee1e57cd85e6fda8dab913b770ff7e5ac3ff50a37ec49d90e9a9e6d2e6","schema_version":"1.0","event_id":"sha256:7273a1ee1e57cd85e6fda8dab913b770ff7e5ac3ff50a37ec49d90e9a9e6d2e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4JXJVDICDBTX3ULTITVRP2OF3/bundle.json","state_url":"https://pith.science/pith/N4JXJVDICDBTX3ULTITVRP2OF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4JXJVDICDBTX3ULTITVRP2OF3/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-05-26T04:27:48Z","links":{"resolver":"https://pith.science/pith/N4JXJVDICDBTX3ULTITVRP2OF3","bundle":"https://pith.science/pith/N4JXJVDICDBTX3ULTITVRP2OF3/bundle.json","state":"https://pith.science/pith/N4JXJVDICDBTX3ULTITVRP2OF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4JXJVDICDBTX3ULTITVRP2OF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:N4JXJVDICDBTX3ULTITVRP2OF3","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":"1aac11ded0c05237123afa382f9bb7ac38a99cf0d31865501ed69d94fe84cc95","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T23:38:08Z","title_canon_sha256":"514e3ed1d37b478fdd989908d640fd0a9591454f9710be7b11bc11d34170d825"},"schema_version":"1.0","source":{"id":"2605.21817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21817","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21817v1","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21817","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"N4JXJVDICDBT","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_16","alias_value":"N4JXJVDICDBTX3UL","created_at":"2026-05-22T01:04:09Z"},{"alias_kind":"pith_short_8","alias_value":"N4JXJVDI","created_at":"2026-05-22T01:04:09Z"}],"graph_snapshots":[{"event_id":"sha256:7273a1ee1e57cd85e6fda8dab913b770ff7e5ac3ff50a37ec49d90e9a9e6d2e6","target":"graph","created_at":"2026-05-22T01:04:09Z","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/2605.21817/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a positive integer $k$ and graph $G$, the $\\mathbb{Z}_k$-Ramsey number $R(G,\\mathbb{Z}_k)$ is the least $N$ (if it exists) such that every coloring $f:E(K_N)\\rightarrow \\mathbb{Z}_k$ contains a copy $G'$ of $G$ such that $\\sum_{e\\in E(G')}f(e)=0$. Motivated by a question of Caro and Mifsud, we study the $\\mathbb{Z}_k$-Ramsey number of graphs with a sufficiently large 2-packing, i.e. a set of vertices $S\\subseteq V(G)$ such that $N[u]\\cap N[v]=\\emptyset$ for all distinct $u,v\\in S$. In particular, we prove that $R(G,\\mathbb{Z}_p)\\leq n+6p-9$ for all $n$-vertex graphs $G$ and all primes $p","authors_text":"Andrew Simmons, Emily Heath","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T23:38:08Z","title":"A linear upper bound on the $\\mathbb{Z}_p$-Ramsey number of graphs with sufficiently large $2$-packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21817","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:3a794da83b316e0d682b2d3177f51187ad7da24c14108330d6c259b982118c18","target":"record","created_at":"2026-05-22T01:04:09Z","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":"1aac11ded0c05237123afa382f9bb7ac38a99cf0d31865501ed69d94fe84cc95","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T23:38:08Z","title_canon_sha256":"514e3ed1d37b478fdd989908d640fd0a9591454f9710be7b11bc11d34170d825"},"schema_version":"1.0","source":{"id":"2605.21817","kind":"arxiv","version":1}},"canonical_sha256":"6f1374d46810c33bee8b9a2758bf4e2ed19aee8c7e1eac75226e46ff5078e312","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f1374d46810c33bee8b9a2758bf4e2ed19aee8c7e1eac75226e46ff5078e312","first_computed_at":"2026-05-22T01:04:09.182823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:09.182823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1cgtnE1bWzNI+ZfomTk6CImvVSXTfDTqQuhIsHzLpBAs4sGi0GS02zzCM0oIrxY+b/yzQKD1wIRePut2F+NOCQ==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:09.183857Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a794da83b316e0d682b2d3177f51187ad7da24c14108330d6c259b982118c18","sha256:7273a1ee1e57cd85e6fda8dab913b770ff7e5ac3ff50a37ec49d90e9a9e6d2e6"],"state_sha256":"07fb1b54b7767bd5a6010d823b828420061b0db6f9bcf2733b53d80dd8b020e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CU8e69/U/r5UJwamotxg/Gm2nxEU3Wn81YAsSLCtAvR85CMXGdd/EC/zl7GAs8dyEcgFgvIRF8KcYG7tWwDlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:27:48.661714Z","bundle_sha256":"4734d0b1cd8a9ced3d9bd71d3587ee8414e9ed1b621f818596728a4209401695"}}