{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S4567GV5344YK5ZR5XK6UFGX4W","short_pith_number":"pith:S4567GV5","canonical_record":{"source":{"id":"1704.00048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T20:26:17Z","cross_cats_sorted":[],"title_canon_sha256":"81664cdacf5f5e8cddde327a3eeafaf4fb2160361d993e479da007569e02448d","abstract_canon_sha256":"3c3269c09e46ec489afbcc474db1199c063f216fae2bd51d581cd86a7fc0d6f5"},"schema_version":"1.0"},"canonical_sha256":"973bef9abddf39857731edd5ea14d7e585839f9c6eca514edd897e4360efc81e","source":{"kind":"arxiv","id":"1704.00048","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00048","created_at":"2026-05-18T00:47:25Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00048v1","created_at":"2026-05-18T00:47:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00048","created_at":"2026-05-18T00:47:25Z"},{"alias_kind":"pith_short_12","alias_value":"S4567GV5344Y","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S4567GV5344YK5ZR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S4567GV5","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S4567GV5344YK5ZR5XK6UFGX4W","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T20:26:17Z","cross_cats_sorted":[],"title_canon_sha256":"81664cdacf5f5e8cddde327a3eeafaf4fb2160361d993e479da007569e02448d","abstract_canon_sha256":"3c3269c09e46ec489afbcc474db1199c063f216fae2bd51d581cd86a7fc0d6f5"},"schema_version":"1.0"},"canonical_sha256":"973bef9abddf39857731edd5ea14d7e585839f9c6eca514edd897e4360efc81e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:25.578756Z","signature_b64":"kenhhLPipF7c81d68q9trwhRy5kScDJBXOWdforcaRtyOBY2kweKSS8n9R5kMokcVbAdPrfoY6fTwM5eTLFYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"973bef9abddf39857731edd5ea14d7e585839f9c6eca514edd897e4360efc81e","last_reissued_at":"2026-05-18T00:47:25.578066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:25.578066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00048","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-18T00:47:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4MMtkX3ICrzeidHKQn6TmMJr83MLjdJkfcrsoIQDEE92ffP4NKrdvie0innNd0X1cm6oULWVepkJENhhQ23Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:17:11.106353Z"},"content_sha256":"abecfeefb6fe5e51e62b8c32318b62b2f9f6fe8bf3f5a9c73b444cd2dcb37419","schema_version":"1.0","event_id":"sha256:abecfeefb6fe5e51e62b8c32318b62b2f9f6fe8bf3f5a9c73b444cd2dcb37419"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S4567GV5344YK5ZR5XK6UFGX4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Many edge-disjoint rainbow spanning trees in general graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lauren M. Nelsen, Paul Horn","submitted_at":"2017-03-31T20:26:17Z","abstract_excerpt":"A rainbow spanning tree in an edge-colored graph is a spanning tree in which each edge is a different color. Carraher, Hartke, and Horn showed that for $n$ and $C$ large enough, if $G$ is an edge-colored copy of $K_n$ in which each color class has size at most $n/2$, then $G$ has at least $\\lfloor n/(C\\log n)\\rfloor$ edge-disjoint rainbow spanning trees. Here we strengthen this result by showing that if $G$ is any edge-colored graph with $n$ vertices in which each color appears on at most $\\delta\\cdot\\lambda_1/2$ edges, where $\\delta\\geq C\\log n$ for $n$ and $C$ sufficiently large and $\\lambda"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00048","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-18T00:47:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5YJV6ZIAusogUlL+BhKcUPkHxB67tV8c8wyWNP2W0snWeylVsZXhbOIR9gpJx8ewEsjEkh/nDLR2X1V03ysDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:17:11.106707Z"},"content_sha256":"05fc93f12e61420542a8907e49f5fc356d86d193d0c6cbc2a3126642f772b3c0","schema_version":"1.0","event_id":"sha256:05fc93f12e61420542a8907e49f5fc356d86d193d0c6cbc2a3126642f772b3c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4567GV5344YK5ZR5XK6UFGX4W/bundle.json","state_url":"https://pith.science/pith/S4567GV5344YK5ZR5XK6UFGX4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4567GV5344YK5ZR5XK6UFGX4W/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-03T15:17:11Z","links":{"resolver":"https://pith.science/pith/S4567GV5344YK5ZR5XK6UFGX4W","bundle":"https://pith.science/pith/S4567GV5344YK5ZR5XK6UFGX4W/bundle.json","state":"https://pith.science/pith/S4567GV5344YK5ZR5XK6UFGX4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4567GV5344YK5ZR5XK6UFGX4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S4567GV5344YK5ZR5XK6UFGX4W","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":"3c3269c09e46ec489afbcc474db1199c063f216fae2bd51d581cd86a7fc0d6f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T20:26:17Z","title_canon_sha256":"81664cdacf5f5e8cddde327a3eeafaf4fb2160361d993e479da007569e02448d"},"schema_version":"1.0","source":{"id":"1704.00048","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00048","created_at":"2026-05-18T00:47:25Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00048v1","created_at":"2026-05-18T00:47:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00048","created_at":"2026-05-18T00:47:25Z"},{"alias_kind":"pith_short_12","alias_value":"S4567GV5344Y","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S4567GV5344YK5ZR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S4567GV5","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:05fc93f12e61420542a8907e49f5fc356d86d193d0c6cbc2a3126642f772b3c0","target":"graph","created_at":"2026-05-18T00:47:25Z","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 rainbow spanning tree in an edge-colored graph is a spanning tree in which each edge is a different color. Carraher, Hartke, and Horn showed that for $n$ and $C$ large enough, if $G$ is an edge-colored copy of $K_n$ in which each color class has size at most $n/2$, then $G$ has at least $\\lfloor n/(C\\log n)\\rfloor$ edge-disjoint rainbow spanning trees. Here we strengthen this result by showing that if $G$ is any edge-colored graph with $n$ vertices in which each color appears on at most $\\delta\\cdot\\lambda_1/2$ edges, where $\\delta\\geq C\\log n$ for $n$ and $C$ sufficiently large and $\\lambda","authors_text":"Lauren M. Nelsen, Paul Horn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T20:26:17Z","title":"Many edge-disjoint rainbow spanning trees in general graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00048","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:abecfeefb6fe5e51e62b8c32318b62b2f9f6fe8bf3f5a9c73b444cd2dcb37419","target":"record","created_at":"2026-05-18T00:47:25Z","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":"3c3269c09e46ec489afbcc474db1199c063f216fae2bd51d581cd86a7fc0d6f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T20:26:17Z","title_canon_sha256":"81664cdacf5f5e8cddde327a3eeafaf4fb2160361d993e479da007569e02448d"},"schema_version":"1.0","source":{"id":"1704.00048","kind":"arxiv","version":1}},"canonical_sha256":"973bef9abddf39857731edd5ea14d7e585839f9c6eca514edd897e4360efc81e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"973bef9abddf39857731edd5ea14d7e585839f9c6eca514edd897e4360efc81e","first_computed_at":"2026-05-18T00:47:25.578066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:25.578066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kenhhLPipF7c81d68q9trwhRy5kScDJBXOWdforcaRtyOBY2kweKSS8n9R5kMokcVbAdPrfoY6fTwM5eTLFYAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:25.578756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00048","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abecfeefb6fe5e51e62b8c32318b62b2f9f6fe8bf3f5a9c73b444cd2dcb37419","sha256:05fc93f12e61420542a8907e49f5fc356d86d193d0c6cbc2a3126642f772b3c0"],"state_sha256":"7b6a6edd16f692efa66643317a224e9caf7e54baf53a9440e18cccf33dac1f3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/hRrQ4sgsx1zbOo4V0q6y0lJsb/jhBaSvhngJD+QMf2hU6ziJ/pa3RnBFs0rbUY8j8O40EjLC6Rgb+WaY+RcBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:17:11.108628Z","bundle_sha256":"dd3b273fce7a5d18b5f9fcb9bafb39c54c53cd9e5581d6fe050b6aebfbfb132d"}}