{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Y5QUX4EXMK2H5VFZEPBG433JMD","short_pith_number":"pith:Y5QUX4EX","schema_version":"1.0","canonical_sha256":"c7614bf09762b47ed4b923c26e6f6960dcb6063be6bd23c63c3d7b3472b5039d","source":{"kind":"arxiv","id":"1106.2441","version":1},"attestation_state":"computed","paper":{"title":"An f-chromatic spanning forest of edge-colored complete bipartite 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-06-13T13:40:06Z","abstract_excerpt":"In 2001, Brualdi and Hollingsworth proved that an edge-colored balanced complete bipartite graph Kn,n with a color set C = {1,2,3,..., 2n-1} has a heterochromatic spanning tree if the number of edges colored with colors in R is more than |R|^2 /4 for any non-empty subset R \\subseteq C, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors, namely, any color appears at most once. In 2010, Suzuki generalized heterochromatic graphs to f-chromatic graphs, where any color c appears at most f(c). Moreover, he presented a necessary and sufficient condition for grap"},"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":"1106.2441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-13T13:40:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"07a43104e94125dc8e62b3bdb116c2ad214077d85f7dec576976d04a1543261f","abstract_canon_sha256":"d346f39857d4e5aff6f9a1d0b07237b20dd77f6256fcbe3e5e81b8b908cb4928"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:31.844247Z","signature_b64":"riaNsYZTcR5W1+pxy24Bum3o3xksZ6/RtQyxGUC3k2jRa/W6zLNNSzVChf5azfscDK1i/ty2DZdczk5CyuAYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7614bf09762b47ed4b923c26e6f6960dcb6063be6bd23c63c3d7b3472b5039d","last_reissued_at":"2026-05-18T00:08:31.843704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:31.843704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An f-chromatic spanning forest of edge-colored complete bipartite 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-06-13T13:40:06Z","abstract_excerpt":"In 2001, Brualdi and Hollingsworth proved that an edge-colored balanced complete bipartite graph Kn,n with a color set C = {1,2,3,..., 2n-1} has a heterochromatic spanning tree if the number of edges colored with colors in R is more than |R|^2 /4 for any non-empty subset R \\subseteq C, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors, namely, any color appears at most once. In 2010, Suzuki generalized heterochromatic graphs to f-chromatic graphs, where any color c appears at most f(c). Moreover, he presented a necessary and sufficient condition for grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2441","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":"1106.2441","created_at":"2026-05-18T00:08:31.843795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2441v1","created_at":"2026-05-18T00:08:31.843795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2441","created_at":"2026-05-18T00:08:31.843795+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5QUX4EXMK2H","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5QUX4EXMK2H5VFZ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5QUX4EX","created_at":"2026-05-18T12:26:47.523578+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/Y5QUX4EXMK2H5VFZEPBG433JMD","json":"https://pith.science/pith/Y5QUX4EXMK2H5VFZEPBG433JMD.json","graph_json":"https://pith.science/api/pith-number/Y5QUX4EXMK2H5VFZEPBG433JMD/graph.json","events_json":"https://pith.science/api/pith-number/Y5QUX4EXMK2H5VFZEPBG433JMD/events.json","paper":"https://pith.science/paper/Y5QUX4EX"},"agent_actions":{"view_html":"https://pith.science/pith/Y5QUX4EXMK2H5VFZEPBG433JMD","download_json":"https://pith.science/pith/Y5QUX4EXMK2H5VFZEPBG433JMD.json","view_paper":"https://pith.science/paper/Y5QUX4EX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2441&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5QUX4EXMK2H5VFZEPBG433JMD/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5QUX4EXMK2H5VFZEPBG433JMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5QUX4EXMK2H5VFZEPBG433JMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5QUX4EXMK2H5VFZEPBG433JMD/action/storage_attestation","attest_author":"https://pith.science/pith/Y5QUX4EXMK2H5VFZEPBG433JMD/action/author_attestation","sign_citation":"https://pith.science/pith/Y5QUX4EXMK2H5VFZEPBG433JMD/action/citation_signature","submit_replication":"https://pith.science/pith/Y5QUX4EXMK2H5VFZEPBG433JMD/action/replication_record"}},"created_at":"2026-05-18T00:08:31.843795+00:00","updated_at":"2026-05-18T00:08:31.843795+00:00"}