{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3G2HQO23YR24H4AD5QTREJACIE","short_pith_number":"pith:3G2HQO23","canonical_record":{"source":{"id":"2502.03864","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-06T08:25:28Z","cross_cats_sorted":[],"title_canon_sha256":"615760805e6cdef7ae4ba4ced2cd88265a7e50730b2ebb8c9f13b8d99c883954","abstract_canon_sha256":"bd80ddf6d35631956f177c97aa62018f241d9819837a6aeac4b0ea8c0106bdc6"},"schema_version":"1.0"},"canonical_sha256":"d9b4783b5bc475c3f003ec27122402410a91de5d0222e0062aad867fe0a50e53","source":{"kind":"arxiv","id":"2502.03864","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.03864","created_at":"2026-06-12T01:09:07Z"},{"alias_kind":"arxiv_version","alias_value":"2502.03864v2","created_at":"2026-06-12T01:09:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03864","created_at":"2026-06-12T01:09:07Z"},{"alias_kind":"pith_short_12","alias_value":"3G2HQO23YR24","created_at":"2026-06-12T01:09:07Z"},{"alias_kind":"pith_short_16","alias_value":"3G2HQO23YR24H4AD","created_at":"2026-06-12T01:09:07Z"},{"alias_kind":"pith_short_8","alias_value":"3G2HQO23","created_at":"2026-06-12T01:09:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3G2HQO23YR24H4AD5QTREJACIE","target":"record","payload":{"canonical_record":{"source":{"id":"2502.03864","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-06T08:25:28Z","cross_cats_sorted":[],"title_canon_sha256":"615760805e6cdef7ae4ba4ced2cd88265a7e50730b2ebb8c9f13b8d99c883954","abstract_canon_sha256":"bd80ddf6d35631956f177c97aa62018f241d9819837a6aeac4b0ea8c0106bdc6"},"schema_version":"1.0"},"canonical_sha256":"d9b4783b5bc475c3f003ec27122402410a91de5d0222e0062aad867fe0a50e53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:07.199777Z","signature_b64":"HnAtaoR7zHML2gFcemmtwdCA3YNV8/oenE51NCIt+pMJQfMguvvEXnSOagVjP4uHl9cqHWcEpFeqfQLYt573Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9b4783b5bc475c3f003ec27122402410a91de5d0222e0062aad867fe0a50e53","last_reissued_at":"2026-06-12T01:09:07.199122Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:07.199122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.03864","source_version":2,"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-06-12T01:09:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZeUtD5WmLWFyzrq/7ll0HlxTgzp6IE4H2iRN6ADP+PEn8su3v4PQeCPhSZGUYa3nGBF+qZSghyAqCpuPZAu7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:37:16.386759Z"},"content_sha256":"1c7a23057d9270cbe69b92f2a71861dfee3aac5e0b88268120ab21d3ffdfb2a4","schema_version":"1.0","event_id":"sha256:1c7a23057d9270cbe69b92f2a71861dfee3aac5e0b88268120ab21d3ffdfb2a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3G2HQO23YR24H4AD5QTREJACIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On zero-sum Ramsey numbers modulo 3","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xandru Mifsud, Yair Caro","submitted_at":"2025-02-06T08:25:28Z","abstract_excerpt":"We start with a systematic study of the zero-sum Ramsey numbers. For a graph $G$ with $0 \\ (\\!\\!\\!\\!\\mod 3)$ edges, the zero-sum Ramsey number is defined as the smallest positive integer $R(G, \\mathbb{Z}_3)$ such that for every $n \\geq R(G, \\mathbb{Z}_3)$ and every edge-colouring $f$ of $K_n$ using $\\mathbb{Z}_3$, there is a zero-sum copy of $G$ in $K_n$ coloured by $f$, that is: $\\sum_{e \\in E(G)} f(e) \\equiv 0 \\ (\\!\\!\\!\\!\\mod 3)$.\n  Only sporadic results are known for these Ramsey numbers, and we discover many new ones. In particular we prove that for every forest $F$ on $n$ vertices and wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03864","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/2502.03864/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-06-12T01:09:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ge788Yn5wuKiQkOdNIAkvp3y7hmrxHut3JCXETgR3/3m31vxRbCGw58Xn4gIwmKSojSkezQcPCIMlJ2az1MCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:37:16.387121Z"},"content_sha256":"69f33c0cfe7a33483e98e628df856db2e18cd212b1d46252becb401cfaef8ea5","schema_version":"1.0","event_id":"sha256:69f33c0cfe7a33483e98e628df856db2e18cd212b1d46252becb401cfaef8ea5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3G2HQO23YR24H4AD5QTREJACIE/bundle.json","state_url":"https://pith.science/pith/3G2HQO23YR24H4AD5QTREJACIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3G2HQO23YR24H4AD5QTREJACIE/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-29T06:37:16Z","links":{"resolver":"https://pith.science/pith/3G2HQO23YR24H4AD5QTREJACIE","bundle":"https://pith.science/pith/3G2HQO23YR24H4AD5QTREJACIE/bundle.json","state":"https://pith.science/pith/3G2HQO23YR24H4AD5QTREJACIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3G2HQO23YR24H4AD5QTREJACIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3G2HQO23YR24H4AD5QTREJACIE","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":"bd80ddf6d35631956f177c97aa62018f241d9819837a6aeac4b0ea8c0106bdc6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-06T08:25:28Z","title_canon_sha256":"615760805e6cdef7ae4ba4ced2cd88265a7e50730b2ebb8c9f13b8d99c883954"},"schema_version":"1.0","source":{"id":"2502.03864","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.03864","created_at":"2026-06-12T01:09:07Z"},{"alias_kind":"arxiv_version","alias_value":"2502.03864v2","created_at":"2026-06-12T01:09:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03864","created_at":"2026-06-12T01:09:07Z"},{"alias_kind":"pith_short_12","alias_value":"3G2HQO23YR24","created_at":"2026-06-12T01:09:07Z"},{"alias_kind":"pith_short_16","alias_value":"3G2HQO23YR24H4AD","created_at":"2026-06-12T01:09:07Z"},{"alias_kind":"pith_short_8","alias_value":"3G2HQO23","created_at":"2026-06-12T01:09:07Z"}],"graph_snapshots":[{"event_id":"sha256:69f33c0cfe7a33483e98e628df856db2e18cd212b1d46252becb401cfaef8ea5","target":"graph","created_at":"2026-06-12T01:09:07Z","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/2502.03864/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We start with a systematic study of the zero-sum Ramsey numbers. For a graph $G$ with $0 \\ (\\!\\!\\!\\!\\mod 3)$ edges, the zero-sum Ramsey number is defined as the smallest positive integer $R(G, \\mathbb{Z}_3)$ such that for every $n \\geq R(G, \\mathbb{Z}_3)$ and every edge-colouring $f$ of $K_n$ using $\\mathbb{Z}_3$, there is a zero-sum copy of $G$ in $K_n$ coloured by $f$, that is: $\\sum_{e \\in E(G)} f(e) \\equiv 0 \\ (\\!\\!\\!\\!\\mod 3)$.\n  Only sporadic results are known for these Ramsey numbers, and we discover many new ones. In particular we prove that for every forest $F$ on $n$ vertices and wit","authors_text":"Xandru Mifsud, Yair Caro","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-06T08:25:28Z","title":"On zero-sum Ramsey numbers modulo 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03864","kind":"arxiv","version":2},"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:1c7a23057d9270cbe69b92f2a71861dfee3aac5e0b88268120ab21d3ffdfb2a4","target":"record","created_at":"2026-06-12T01:09:07Z","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":"bd80ddf6d35631956f177c97aa62018f241d9819837a6aeac4b0ea8c0106bdc6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-06T08:25:28Z","title_canon_sha256":"615760805e6cdef7ae4ba4ced2cd88265a7e50730b2ebb8c9f13b8d99c883954"},"schema_version":"1.0","source":{"id":"2502.03864","kind":"arxiv","version":2}},"canonical_sha256":"d9b4783b5bc475c3f003ec27122402410a91de5d0222e0062aad867fe0a50e53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9b4783b5bc475c3f003ec27122402410a91de5d0222e0062aad867fe0a50e53","first_computed_at":"2026-06-12T01:09:07.199122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:07.199122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HnAtaoR7zHML2gFcemmtwdCA3YNV8/oenE51NCIt+pMJQfMguvvEXnSOagVjP4uHl9cqHWcEpFeqfQLYt573Dg==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:07.199777Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.03864","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c7a23057d9270cbe69b92f2a71861dfee3aac5e0b88268120ab21d3ffdfb2a4","sha256:69f33c0cfe7a33483e98e628df856db2e18cd212b1d46252becb401cfaef8ea5"],"state_sha256":"94c0f7ba966ee417b95b75ffa37a946a9d8fdc8512d6369178a2f8e05271e8d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K616LFuNLbjVfbv/dk/EmPNPTI2RXxxDjJ69CzQ74cHhwoV57EB8gHlIDDQDLArMc/U94bxQhC6VHFlXGu4MBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T06:37:16.389187Z","bundle_sha256":"9147fa2bb876b4227057dd3c37f707c6c30cf9b1ee31faf46ef03e85d0e69573"}}