{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SB6AAURGLZ3D5CQMKQT5ZJYEMQ","short_pith_number":"pith:SB6AAURG","canonical_record":{"source":{"id":"2507.13165","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T14:31:49Z","cross_cats_sorted":[],"title_canon_sha256":"cae1c0a86e74d63de5c5f5412f5fa681ebd6a820c62cdcbe5317a62ec5fc1483","abstract_canon_sha256":"e391264c18cddfa9347442f794cf68b21feec68d6d47bca3a4229dc77c3d3b2c"},"schema_version":"1.0"},"canonical_sha256":"907c0052265e763e8a0c5427dca704643214c9a9f1221abcd481260433ff985a","source":{"kind":"arxiv","id":"2507.13165","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.13165","created_at":"2026-07-05T11:38:55Z"},{"alias_kind":"arxiv_version","alias_value":"2507.13165v1","created_at":"2026-07-05T11:38:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13165","created_at":"2026-07-05T11:38:55Z"},{"alias_kind":"pith_short_12","alias_value":"SB6AAURGLZ3D","created_at":"2026-07-05T11:38:55Z"},{"alias_kind":"pith_short_16","alias_value":"SB6AAURGLZ3D5CQM","created_at":"2026-07-05T11:38:55Z"},{"alias_kind":"pith_short_8","alias_value":"SB6AAURG","created_at":"2026-07-05T11:38:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SB6AAURGLZ3D5CQMKQT5ZJYEMQ","target":"record","payload":{"canonical_record":{"source":{"id":"2507.13165","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T14:31:49Z","cross_cats_sorted":[],"title_canon_sha256":"cae1c0a86e74d63de5c5f5412f5fa681ebd6a820c62cdcbe5317a62ec5fc1483","abstract_canon_sha256":"e391264c18cddfa9347442f794cf68b21feec68d6d47bca3a4229dc77c3d3b2c"},"schema_version":"1.0"},"canonical_sha256":"907c0052265e763e8a0c5427dca704643214c9a9f1221abcd481260433ff985a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:55.741771Z","signature_b64":"5SoPAmNt5rSvqPi4idkPsdj1gl5NEhMBqUzMIvx9Iyu2HwXAN8T/dqb3kvndg8387Wf/xsC+rqZEXbdyUScPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"907c0052265e763e8a0c5427dca704643214c9a9f1221abcd481260433ff985a","last_reissued_at":"2026-07-05T11:38:55.741247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:55.741247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.13165","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-07-05T11:38:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36a5tpFhvMCv9MMcOugymexnwHtzjmz44IPaGEh96aNEE8eIBdfSc/D6KzztSpjUbp5+xdB0EVZcoKXDZkYnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:08:05.024405Z"},"content_sha256":"125d380f9c7d224649a7a3a24f5adcacedbc7cde7b0ad39c45580ae3761225c5","schema_version":"1.0","event_id":"sha256:125d380f9c7d224649a7a3a24f5adcacedbc7cde7b0ad39c45580ae3761225c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SB6AAURGLZ3D5CQMKQT5ZJYEMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anti-Ramsey number of intersecting cliques","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Xinxin Ma, Xinyue Luo","submitted_at":"2025-07-17T14:31:49Z","abstract_excerpt":"An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The anti-Ramsey number $ar(n, G)$, for a graph $G$ and a positive integer $n$, is defined as the minimum number of colors $r$ such that every exact $r$-edge-coloring of the complete graph $K_n$ contains at least one rainbow copy of $G$. A $(k, r)$-fan graph, denoted $F_{k, r}$, is a graph composed of $k$ cliques each of size $r$, all intersecting at exactly one common vertex. In this paper, we determine $ar(n, F_{k, r})$ for $n \\geq 256r^{16}(k+1)^5$, $k \\geq 1$, and $r \\geq 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13165","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/2507.13165/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-07-05T11:38:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SMB7cOEUavJghpkJhQNYJ42q0duq5ys59Ap47zETC5Ea5W03PmYpG8gqqLHOvYU/+Il9zAUK082NHiAi4B5kCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:08:05.025002Z"},"content_sha256":"cb7c9a93af25bfa3e13e69bd5a3d248d1319b94a6a60dd6e9130fe97e8fadaeb","schema_version":"1.0","event_id":"sha256:cb7c9a93af25bfa3e13e69bd5a3d248d1319b94a6a60dd6e9130fe97e8fadaeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SB6AAURGLZ3D5CQMKQT5ZJYEMQ/bundle.json","state_url":"https://pith.science/pith/SB6AAURGLZ3D5CQMKQT5ZJYEMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SB6AAURGLZ3D5CQMKQT5ZJYEMQ/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-08-10T08:08:05Z","links":{"resolver":"https://pith.science/pith/SB6AAURGLZ3D5CQMKQT5ZJYEMQ","bundle":"https://pith.science/pith/SB6AAURGLZ3D5CQMKQT5ZJYEMQ/bundle.json","state":"https://pith.science/pith/SB6AAURGLZ3D5CQMKQT5ZJYEMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SB6AAURGLZ3D5CQMKQT5ZJYEMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SB6AAURGLZ3D5CQMKQT5ZJYEMQ","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":"e391264c18cddfa9347442f794cf68b21feec68d6d47bca3a4229dc77c3d3b2c","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T14:31:49Z","title_canon_sha256":"cae1c0a86e74d63de5c5f5412f5fa681ebd6a820c62cdcbe5317a62ec5fc1483"},"schema_version":"1.0","source":{"id":"2507.13165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.13165","created_at":"2026-07-05T11:38:55Z"},{"alias_kind":"arxiv_version","alias_value":"2507.13165v1","created_at":"2026-07-05T11:38:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13165","created_at":"2026-07-05T11:38:55Z"},{"alias_kind":"pith_short_12","alias_value":"SB6AAURGLZ3D","created_at":"2026-07-05T11:38:55Z"},{"alias_kind":"pith_short_16","alias_value":"SB6AAURGLZ3D5CQM","created_at":"2026-07-05T11:38:55Z"},{"alias_kind":"pith_short_8","alias_value":"SB6AAURG","created_at":"2026-07-05T11:38:55Z"}],"graph_snapshots":[{"event_id":"sha256:cb7c9a93af25bfa3e13e69bd5a3d248d1319b94a6a60dd6e9130fe97e8fadaeb","target":"graph","created_at":"2026-07-05T11:38:55Z","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.13165/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The anti-Ramsey number $ar(n, G)$, for a graph $G$ and a positive integer $n$, is defined as the minimum number of colors $r$ such that every exact $r$-edge-coloring of the complete graph $K_n$ contains at least one rainbow copy of $G$. A $(k, r)$-fan graph, denoted $F_{k, r}$, is a graph composed of $k$ cliques each of size $r$, all intersecting at exactly one common vertex. In this paper, we determine $ar(n, F_{k, r})$ for $n \\geq 256r^{16}(k+1)^5$, $k \\geq 1$, and $r \\geq 2$.","authors_text":"Hongliang Lu, Xinxin Ma, Xinyue Luo","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T14:31:49Z","title":"Anti-Ramsey number of intersecting cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13165","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:125d380f9c7d224649a7a3a24f5adcacedbc7cde7b0ad39c45580ae3761225c5","target":"record","created_at":"2026-07-05T11:38:55Z","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":"e391264c18cddfa9347442f794cf68b21feec68d6d47bca3a4229dc77c3d3b2c","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T14:31:49Z","title_canon_sha256":"cae1c0a86e74d63de5c5f5412f5fa681ebd6a820c62cdcbe5317a62ec5fc1483"},"schema_version":"1.0","source":{"id":"2507.13165","kind":"arxiv","version":1}},"canonical_sha256":"907c0052265e763e8a0c5427dca704643214c9a9f1221abcd481260433ff985a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"907c0052265e763e8a0c5427dca704643214c9a9f1221abcd481260433ff985a","first_computed_at":"2026-07-05T11:38:55.741247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:38:55.741247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5SoPAmNt5rSvqPi4idkPsdj1gl5NEhMBqUzMIvx9Iyu2HwXAN8T/dqb3kvndg8387Wf/xsC+rqZEXbdyUScPDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:38:55.741771Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.13165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:125d380f9c7d224649a7a3a24f5adcacedbc7cde7b0ad39c45580ae3761225c5","sha256:cb7c9a93af25bfa3e13e69bd5a3d248d1319b94a6a60dd6e9130fe97e8fadaeb"],"state_sha256":"b57d3fca4cce69b80ac00b858e2b6bd6a56d7fcad9c163dba5482d0d0b004a05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XMmoffiGfKiNSZX9RfIO7t/SP9KOeMho2FsF5/Zij8jB0VXUbehVT1vLP4LD/5NPTlkXMd2uZBQ+h4xZI2jHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T08:08:05.028751Z","bundle_sha256":"643f3feb1697a0c636d2962bb7c9ac2a1fe4f3ff59cf1df7a52c0941b50d7f7f"}}