{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DZZVYWZRF6PJR2GJ6YMJEK6U5K","short_pith_number":"pith:DZZVYWZR","schema_version":"1.0","canonical_sha256":"1e735c5b312f9e98e8c9f618922bd4eab4f8e604b8a6ade6ea172fd727f7e32a","source":{"kind":"arxiv","id":"1809.10355","version":1},"attestation_state":"computed","paper":{"title":"$(g,f)$-Chromatic spanning trees and forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kazuhiro Suzuki","submitted_at":"2018-09-27T05:54:49Z","abstract_excerpt":"A heterochromatic (or rainbow) graph is an edge-colored graph whose edges have distinct colors, that is, where each color appears at most once. In this paper, I propose a $(g,f)$-chromatic graph as an edge-colored graph where each color $c$ appears at least $g(c)$ times and at most $f(c)$ times. I also present a necessary and sufficient condition for edge-colored graphs (not necessary to be proper) to have a $(g,f)$-chromatic spanning tree. Using this criterion, I show that an edge-colored complete graph $G$ has a spanning tree with a color probability distribution `similar' to that of $G$. Mo"},"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":"1809.10355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-27T05:54:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fc8dccc58d1c336bcc5204f7b0a92269675a4712857fe7f62192307c56f7633d","abstract_canon_sha256":"1d4e7f47559cf540a7beb5bb11077ce2a07ebc797609dcba0b0d758811f98d2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:45.549675Z","signature_b64":"mMQpsY/2zntIq1z6lTaIj7Vdctus7AxkDGrQ88xNaPWLfrx3+fu46H4DPgQpgkFl4Vq9rPqQ0Q/40HxvaJXNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e735c5b312f9e98e8c9f618922bd4eab4f8e604b8a6ade6ea172fd727f7e32a","last_reissued_at":"2026-05-17T23:48:45.549174Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:45.549174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$(g,f)$-Chromatic spanning trees and forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kazuhiro Suzuki","submitted_at":"2018-09-27T05:54:49Z","abstract_excerpt":"A heterochromatic (or rainbow) graph is an edge-colored graph whose edges have distinct colors, that is, where each color appears at most once. In this paper, I propose a $(g,f)$-chromatic graph as an edge-colored graph where each color $c$ appears at least $g(c)$ times and at most $f(c)$ times. I also present a necessary and sufficient condition for edge-colored graphs (not necessary to be proper) to have a $(g,f)$-chromatic spanning tree. Using this criterion, I show that an edge-colored complete graph $G$ has a spanning tree with a color probability distribution `similar' to that of $G$. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10355","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":"1809.10355","created_at":"2026-05-17T23:48:45.549257+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10355v1","created_at":"2026-05-17T23:48:45.549257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10355","created_at":"2026-05-17T23:48:45.549257+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZZVYWZRF6PJ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZZVYWZRF6PJR2GJ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZZVYWZR","created_at":"2026-05-18T12:32:19.392346+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/DZZVYWZRF6PJR2GJ6YMJEK6U5K","json":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K.json","graph_json":"https://pith.science/api/pith-number/DZZVYWZRF6PJR2GJ6YMJEK6U5K/graph.json","events_json":"https://pith.science/api/pith-number/DZZVYWZRF6PJR2GJ6YMJEK6U5K/events.json","paper":"https://pith.science/paper/DZZVYWZR"},"agent_actions":{"view_html":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K","download_json":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K.json","view_paper":"https://pith.science/paper/DZZVYWZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10355&json=true","fetch_graph":"https://pith.science/api/pith-number/DZZVYWZRF6PJR2GJ6YMJEK6U5K/graph.json","fetch_events":"https://pith.science/api/pith-number/DZZVYWZRF6PJR2GJ6YMJEK6U5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K/action/storage_attestation","attest_author":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K/action/author_attestation","sign_citation":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K/action/citation_signature","submit_replication":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K/action/replication_record"}},"created_at":"2026-05-17T23:48:45.549257+00:00","updated_at":"2026-05-17T23:48:45.549257+00:00"}