{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZCZNGHYO3NTOE65FBUW3S3WC3X","short_pith_number":"pith:ZCZNGHYO","schema_version":"1.0","canonical_sha256":"c8b2d31f0edb66e27ba50d2db96ec2ddcebab90ed8c2883543e2a50182fc8060","source":{"kind":"arxiv","id":"1903.10319","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.10319","created_at":"2026-05-17T23:50:29.857103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.10319v1","created_at":"2026-05-17T23:50:29.857103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10319","created_at":"2026-05-17T23:50:29.857103+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCZNGHYO3NTO","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCZNGHYO3NTOE65F","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCZNGHYO","created_at":"2026-05-18T12:33:33.725879+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/ZCZNGHYO3NTOE65FBUW3S3WC3X","json":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X.json","graph_json":"https://pith.science/api/pith-number/ZCZNGHYO3NTOE65FBUW3S3WC3X/graph.json","events_json":"https://pith.science/api/pith-number/ZCZNGHYO3NTOE65FBUW3S3WC3X/events.json","paper":"https://pith.science/paper/ZCZNGHYO"},"agent_actions":{"view_html":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X","download_json":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X.json","view_paper":"https://pith.science/paper/ZCZNGHYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.10319&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCZNGHYO3NTOE65FBUW3S3WC3X/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCZNGHYO3NTOE65FBUW3S3WC3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X/action/storage_attestation","attest_author":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X/action/author_attestation","sign_citation":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X/action/citation_signature","submit_replication":"https://pith.science/pith/ZCZNGHYO3NTOE65FBUW3S3WC3X/action/replication_record"}},"created_at":"2026-05-17T23:50:29.857103+00:00","updated_at":"2026-05-17T23:50:29.857103+00:00"}