{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RCZSHPSBSUL66X6SEEM7GCN4A7","short_pith_number":"pith:RCZSHPSB","schema_version":"1.0","canonical_sha256":"88b323be419517ef5fd22119f309bc07d61ed18c08e2e9abf3166380be790a94","source":{"kind":"arxiv","id":"1102.4802","version":1},"attestation_state":"computed","paper":{"title":"A generalization of heterochromatic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kazuhiro Suzuki","submitted_at":"2011-02-23T17:27:15Z","abstract_excerpt":"In 2006, Suzuki, and Akbari & Alipour independently presented a necessary and sufficient condition for edge-colored graphs to have a heterochromatic spanning tree, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. In this paper, we propose $f$-chromatic graphs as a generalization of heterochromatic graphs. An edge-colored graph is $f$-chromatic if each color $c$ appears on at most $f(c)$ edges. We also present a necessary and sufficient condition for edge-colored graphs to have an $f$-chromatic spanning forest with exactly $m$ components. Moreover, usin"},"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":"1102.4802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-23T17:27:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0f91c71abd41cecb1c434eadbc1eb38dc1eb1227d1aaf63b0a1c5f0eb34fa1d0","abstract_canon_sha256":"ea118199bd015733945a71bc31d1840d3cc012f07b1cd34b2138d09e01f939ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:31.869757Z","signature_b64":"HtqGE4EjbaGONJo6u5uLIXwPJ2euj7rY+kDb6xZXTML2F+Bk2XZzfAGRvyTC0ceXcpyIQUQCGRkUkCSJsysRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b323be419517ef5fd22119f309bc07d61ed18c08e2e9abf3166380be790a94","last_reissued_at":"2026-05-18T00:08:31.869129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:31.869129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of heterochromatic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kazuhiro Suzuki","submitted_at":"2011-02-23T17:27:15Z","abstract_excerpt":"In 2006, Suzuki, and Akbari & Alipour independently presented a necessary and sufficient condition for edge-colored graphs to have a heterochromatic spanning tree, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. In this paper, we propose $f$-chromatic graphs as a generalization of heterochromatic graphs. An edge-colored graph is $f$-chromatic if each color $c$ appears on at most $f(c)$ edges. We also present a necessary and sufficient condition for edge-colored graphs to have an $f$-chromatic spanning forest with exactly $m$ components. Moreover, usin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4802","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":"1102.4802","created_at":"2026-05-18T00:08:31.869248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4802v1","created_at":"2026-05-18T00:08:31.869248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4802","created_at":"2026-05-18T00:08:31.869248+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCZSHPSBSUL6","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCZSHPSBSUL66X6S","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCZSHPSB","created_at":"2026-05-18T12:26:41.206345+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/RCZSHPSBSUL66X6SEEM7GCN4A7","json":"https://pith.science/pith/RCZSHPSBSUL66X6SEEM7GCN4A7.json","graph_json":"https://pith.science/api/pith-number/RCZSHPSBSUL66X6SEEM7GCN4A7/graph.json","events_json":"https://pith.science/api/pith-number/RCZSHPSBSUL66X6SEEM7GCN4A7/events.json","paper":"https://pith.science/paper/RCZSHPSB"},"agent_actions":{"view_html":"https://pith.science/pith/RCZSHPSBSUL66X6SEEM7GCN4A7","download_json":"https://pith.science/pith/RCZSHPSBSUL66X6SEEM7GCN4A7.json","view_paper":"https://pith.science/paper/RCZSHPSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4802&json=true","fetch_graph":"https://pith.science/api/pith-number/RCZSHPSBSUL66X6SEEM7GCN4A7/graph.json","fetch_events":"https://pith.science/api/pith-number/RCZSHPSBSUL66X6SEEM7GCN4A7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCZSHPSBSUL66X6SEEM7GCN4A7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCZSHPSBSUL66X6SEEM7GCN4A7/action/storage_attestation","attest_author":"https://pith.science/pith/RCZSHPSBSUL66X6SEEM7GCN4A7/action/author_attestation","sign_citation":"https://pith.science/pith/RCZSHPSBSUL66X6SEEM7GCN4A7/action/citation_signature","submit_replication":"https://pith.science/pith/RCZSHPSBSUL66X6SEEM7GCN4A7/action/replication_record"}},"created_at":"2026-05-18T00:08:31.869248+00:00","updated_at":"2026-05-18T00:08:31.869248+00:00"}