{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DZZVYWZRF6PJR2GJ6YMJEK6U5K","short_pith_number":"pith:DZZVYWZR","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"},"canonical_sha256":"1e735c5b312f9e98e8c9f618922bd4eab4f8e604b8a6ade6ea172fd727f7e32a","source":{"kind":"arxiv","id":"1809.10355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10355","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10355v1","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10355","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"DZZVYWZRF6PJ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DZZVYWZRF6PJR2GJ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DZZVYWZR","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DZZVYWZRF6PJR2GJ6YMJEK6U5K","target":"record","payload":{"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"},"canonical_sha256":"1e735c5b312f9e98e8c9f618922bd4eab4f8e604b8a6ade6ea172fd727f7e32a","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"},"source_kind":"arxiv","source_id":"1809.10355","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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftgneH2s42I2M7lQItvTYZSTIVAAtz29XZaQ1MfPhrIr5qU6GdjSYgPD7c+xKDW0OTMlO7RAkiZZaBsG9tUEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:59:29.047270Z"},"content_sha256":"cbfbd724f2b3bf2e802362df0630b6dcbe0a28286e1c07e03575dea9a69bab43","schema_version":"1.0","event_id":"sha256:cbfbd724f2b3bf2e802362df0630b6dcbe0a28286e1c07e03575dea9a69bab43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DZZVYWZRF6PJR2GJ6YMJEK6U5K","target":"graph","payload":{"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"},"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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MnIBQIvZA1LvkNcbWGilO/CLZyGxLshJRMxLw1gnhzud5fdimFFON2O6UMg0ddl+e/YroT2knPAZ5xEFNsBOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:59:29.047644Z"},"content_sha256":"eb730202ec1a0578d8c86d3d51d3d952e7c87bc357eac68edf12477966ec11e8","schema_version":"1.0","event_id":"sha256:eb730202ec1a0578d8c86d3d51d3d952e7c87bc357eac68edf12477966ec11e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K/bundle.json","state_url":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K/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-27T18:59:29Z","links":{"resolver":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K","bundle":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K/bundle.json","state":"https://pith.science/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZZVYWZRF6PJR2GJ6YMJEK6U5K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DZZVYWZRF6PJR2GJ6YMJEK6U5K","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":"1d4e7f47559cf540a7beb5bb11077ce2a07ebc797609dcba0b0d758811f98d2f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-27T05:54:49Z","title_canon_sha256":"fc8dccc58d1c336bcc5204f7b0a92269675a4712857fe7f62192307c56f7633d"},"schema_version":"1.0","source":{"id":"1809.10355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10355","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10355v1","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10355","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"DZZVYWZRF6PJ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DZZVYWZRF6PJR2GJ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DZZVYWZR","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:eb730202ec1a0578d8c86d3d51d3d952e7c87bc357eac68edf12477966ec11e8","target":"graph","created_at":"2026-05-17T23:48:45Z","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":"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","authors_text":"Kazuhiro Suzuki","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-27T05:54:49Z","title":"$(g,f)$-Chromatic spanning trees and forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10355","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:cbfbd724f2b3bf2e802362df0630b6dcbe0a28286e1c07e03575dea9a69bab43","target":"record","created_at":"2026-05-17T23:48:45Z","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":"1d4e7f47559cf540a7beb5bb11077ce2a07ebc797609dcba0b0d758811f98d2f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-27T05:54:49Z","title_canon_sha256":"fc8dccc58d1c336bcc5204f7b0a92269675a4712857fe7f62192307c56f7633d"},"schema_version":"1.0","source":{"id":"1809.10355","kind":"arxiv","version":1}},"canonical_sha256":"1e735c5b312f9e98e8c9f618922bd4eab4f8e604b8a6ade6ea172fd727f7e32a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e735c5b312f9e98e8c9f618922bd4eab4f8e604b8a6ade6ea172fd727f7e32a","first_computed_at":"2026-05-17T23:48:45.549174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:45.549174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mMQpsY/2zntIq1z6lTaIj7Vdctus7AxkDGrQ88xNaPWLfrx3+fu46H4DPgQpgkFl4Vq9rPqQ0Q/40HxvaJXNCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:45.549675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbfbd724f2b3bf2e802362df0630b6dcbe0a28286e1c07e03575dea9a69bab43","sha256:eb730202ec1a0578d8c86d3d51d3d952e7c87bc357eac68edf12477966ec11e8"],"state_sha256":"4ea4cae19a734946042d81935f1dd33be2df62e7e8ac2a328587533526278b0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VA/2B6+HqNtjYWcBeUoUNSX0niopFsaPJ+2wDYo6UjN5WSz55l+UapAgTzVi7f66K86BLoOJ2+JXvjFtvGwUBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:59:29.049742Z","bundle_sha256":"911e41962a11a06c05115546ace608031fd85f963925e3db470769d9a7df3a75"}}