{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZCZNGHYO3NTOE65FBUW3S3WC3X","short_pith_number":"pith:ZCZNGHYO","canonical_record":{"source":{"id":"1903.10319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-25T13:46:22Z","cross_cats_sorted":[],"title_canon_sha256":"07153db4f18cf23f52ee7b10c85dae878eb6a64cbc7d1863ebe097b1822c9094","abstract_canon_sha256":"3e59ceabcb28e9f3ff64fd9949a4fcbeed8976e79c5346ee2f75d3c7a16bde66"},"schema_version":"1.0"},"canonical_sha256":"c8b2d31f0edb66e27ba50d2db96ec2ddcebab90ed8c2883543e2a50182fc8060","source":{"kind":"arxiv","id":"1903.10319","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10319","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10319v1","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10319","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZCZNGHYO3NTO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZCZNGHYO3NTOE65F","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZCZNGHYO","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZCZNGHYO3NTOE65FBUW3S3WC3X","target":"record","payload":{"canonical_record":{"source":{"id":"1903.10319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-25T13:46:22Z","cross_cats_sorted":[],"title_canon_sha256":"07153db4f18cf23f52ee7b10c85dae878eb6a64cbc7d1863ebe097b1822c9094","abstract_canon_sha256":"3e59ceabcb28e9f3ff64fd9949a4fcbeed8976e79c5346ee2f75d3c7a16bde66"},"schema_version":"1.0"},"canonical_sha256":"c8b2d31f0edb66e27ba50d2db96ec2ddcebab90ed8c2883543e2a50182fc8060","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:29.857626Z","signature_b64":"K0o5eKwJCpgWPnRvhg5qpuCwN/nV9FKXLWxHqXtSm98CWm+dq6a5NklenEhMzr9XOMm6097Y9VflDoO6MsgTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8b2d31f0edb66e27ba50d2db96ec2ddcebab90ed8c2883543e2a50182fc8060","last_reissued_at":"2026-05-17T23:50:29.856994Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:29.856994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.10319","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-17T23:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LbqgvUQQZpwncXL+xOyMhhanmHSY8JgMH53cxXrDWOYf03mKF8jrVmOVAbfJMQxfoBVYC5oUaudql7toz01bAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:17:25.634135Z"},"content_sha256":"de9894defedc0e5388a50197fc90a815684ed3c743f1a70d6bc81a77f474e6f5","schema_version":"1.0","event_id":"sha256:de9894defedc0e5388a50197fc90a815684ed3c743f1a70d6bc81a77f474e6f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZCZNGHYO3NTOE65FBUW3S3WC3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anti-Ramsey numbers of graphs with some decomposition family sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Long-tu Yuan, Xiao-Dong Zhang","submitted_at":"2019-03-25T13:46:22Z","abstract_excerpt":"For a given graph $H$, the anti-Ramsey number of $H$ is the maximum number of colors in an edge-coloring of a complete graph which does not contain a rainbow copy of $H$. In this paper, we extend the decomposition family of graphs to the decomposition family sequence of graphs and show that $K_5$ is determined by its decomposition family sequence. Based on this new graph notation, we determine the anti-Ramsey numbers for new families of graphs, including the Petersen graph, vertex-disjoint union of cliques, etc., and characterize the extremal colorings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10319","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":""},"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-17T23:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DoDmrfLYv6ENObs1bIPti5dwTihHh4Vhjl5G/kqjmUiv/7TWUnitUjvKq9yiqGJJFxICVgdwu+uHwS/l7af7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:17:25.634493Z"},"content_sha256":"8af03836379a0ff6558d17e14c22ffdc4530c65bd0ec2f9ecca8debd24d3e443","schema_version":"1.0","event_id":"sha256:8af03836379a0ff6558d17e14c22ffdc4530c65bd0ec2f9ecca8debd24d3e443"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X/bundle.json","state_url":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X/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-09T14:17:25Z","links":{"resolver":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X","bundle":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X/bundle.json","state":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZCZNGHYO3NTOE65FBUW3S3WC3X","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":"3e59ceabcb28e9f3ff64fd9949a4fcbeed8976e79c5346ee2f75d3c7a16bde66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-25T13:46:22Z","title_canon_sha256":"07153db4f18cf23f52ee7b10c85dae878eb6a64cbc7d1863ebe097b1822c9094"},"schema_version":"1.0","source":{"id":"1903.10319","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10319","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10319v1","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10319","created_at":"2026-05-17T23:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZCZNGHYO3NTO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZCZNGHYO3NTOE65F","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZCZNGHYO","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:8af03836379a0ff6558d17e14c22ffdc4530c65bd0ec2f9ecca8debd24d3e443","target":"graph","created_at":"2026-05-17T23:50:29Z","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"},"paper":{"abstract_excerpt":"For a given graph $H$, the anti-Ramsey number of $H$ is the maximum number of colors in an edge-coloring of a complete graph which does not contain a rainbow copy of $H$. In this paper, we extend the decomposition family of graphs to the decomposition family sequence of graphs and show that $K_5$ is determined by its decomposition family sequence. Based on this new graph notation, we determine the anti-Ramsey numbers for new families of graphs, including the Petersen graph, vertex-disjoint union of cliques, etc., and characterize the extremal colorings.","authors_text":"Long-tu Yuan, Xiao-Dong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-25T13:46:22Z","title":"Anti-Ramsey numbers of graphs with some decomposition family sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10319","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:de9894defedc0e5388a50197fc90a815684ed3c743f1a70d6bc81a77f474e6f5","target":"record","created_at":"2026-05-17T23:50:29Z","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":"3e59ceabcb28e9f3ff64fd9949a4fcbeed8976e79c5346ee2f75d3c7a16bde66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-25T13:46:22Z","title_canon_sha256":"07153db4f18cf23f52ee7b10c85dae878eb6a64cbc7d1863ebe097b1822c9094"},"schema_version":"1.0","source":{"id":"1903.10319","kind":"arxiv","version":1}},"canonical_sha256":"c8b2d31f0edb66e27ba50d2db96ec2ddcebab90ed8c2883543e2a50182fc8060","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8b2d31f0edb66e27ba50d2db96ec2ddcebab90ed8c2883543e2a50182fc8060","first_computed_at":"2026-05-17T23:50:29.856994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:29.856994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K0o5eKwJCpgWPnRvhg5qpuCwN/nV9FKXLWxHqXtSm98CWm+dq6a5NklenEhMzr9XOMm6097Y9VflDoO6MsgTAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:29.857626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10319","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de9894defedc0e5388a50197fc90a815684ed3c743f1a70d6bc81a77f474e6f5","sha256:8af03836379a0ff6558d17e14c22ffdc4530c65bd0ec2f9ecca8debd24d3e443"],"state_sha256":"3ba0707cae063f3445b0b89fccdebfbc235c3aae6550722f7c01de6754fbee40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtt0K4Y/NafMYBOJDsurAot0LdzL7Cj727ARTTjSs/W9T/aPjZhDAdoNBqBiFFdjlAaV5x7vru6F8onl5KnxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:17:25.636444Z","bundle_sha256":"93baa01f01f1b9bd2fa58bdbbb9073c8f3ced50af67bfd804f3447a655fe6b37"}}