{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XNQIHFCO6ZV434RYKEEUWYYIFV","short_pith_number":"pith:XNQIHFCO","schema_version":"1.0","canonical_sha256":"bb6083944ef66bcdf23851094b63082d750d6822573f8ba5103037fd9effe5b2","source":{"kind":"arxiv","id":"1601.04170","version":1},"attestation_state":"computed","paper":{"title":"On heterochromatic out-directed spanning trees in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eduardo Rivera Campo, Juan Jos\\'e Montellano-Ballesteros","submitted_at":"2016-01-16T14:48:52Z","abstract_excerpt":"Given a tournament T, let h(T) be the smallest integer k such that every arc-coloring of T with k or more colors produces at least one out-directed spanning tree of T with no pair of arcs with the same color. In this paper we give the exact value of h(T)."},"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":"1601.04170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-16T14:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"ac3f07b7c3cab2539083166caf20560d057a0f9a6be6f8d3cb1d8f5de538d167","abstract_canon_sha256":"14bbecef1ccd30448b3e016068e429becbf23e5a5ace3b13e9096b40c7f914ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:45.747626Z","signature_b64":"MpolduzqBkVfnCSjSzXrCWYfcbRW7FX5jRx3pYhgI8mW27lX8BKGepS7msR/3qAzwv8tVB9vplvRdWVZe79fBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb6083944ef66bcdf23851094b63082d750d6822573f8ba5103037fd9effe5b2","last_reissued_at":"2026-05-18T01:22:45.747139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:45.747139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On heterochromatic out-directed spanning trees in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eduardo Rivera Campo, Juan Jos\\'e Montellano-Ballesteros","submitted_at":"2016-01-16T14:48:52Z","abstract_excerpt":"Given a tournament T, let h(T) be the smallest integer k such that every arc-coloring of T with k or more colors produces at least one out-directed spanning tree of T with no pair of arcs with the same color. In this paper we give the exact value of h(T)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04170","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":"1601.04170","created_at":"2026-05-18T01:22:45.747219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04170v1","created_at":"2026-05-18T01:22:45.747219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04170","created_at":"2026-05-18T01:22:45.747219+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNQIHFCO6ZV4","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNQIHFCO6ZV434RY","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNQIHFCO","created_at":"2026-05-18T12:30:51.357362+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/XNQIHFCO6ZV434RYKEEUWYYIFV","json":"https://pith.science/pith/XNQIHFCO6ZV434RYKEEUWYYIFV.json","graph_json":"https://pith.science/api/pith-number/XNQIHFCO6ZV434RYKEEUWYYIFV/graph.json","events_json":"https://pith.science/api/pith-number/XNQIHFCO6ZV434RYKEEUWYYIFV/events.json","paper":"https://pith.science/paper/XNQIHFCO"},"agent_actions":{"view_html":"https://pith.science/pith/XNQIHFCO6ZV434RYKEEUWYYIFV","download_json":"https://pith.science/pith/XNQIHFCO6ZV434RYKEEUWYYIFV.json","view_paper":"https://pith.science/paper/XNQIHFCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04170&json=true","fetch_graph":"https://pith.science/api/pith-number/XNQIHFCO6ZV434RYKEEUWYYIFV/graph.json","fetch_events":"https://pith.science/api/pith-number/XNQIHFCO6ZV434RYKEEUWYYIFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNQIHFCO6ZV434RYKEEUWYYIFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNQIHFCO6ZV434RYKEEUWYYIFV/action/storage_attestation","attest_author":"https://pith.science/pith/XNQIHFCO6ZV434RYKEEUWYYIFV/action/author_attestation","sign_citation":"https://pith.science/pith/XNQIHFCO6ZV434RYKEEUWYYIFV/action/citation_signature","submit_replication":"https://pith.science/pith/XNQIHFCO6ZV434RYKEEUWYYIFV/action/replication_record"}},"created_at":"2026-05-18T01:22:45.747219+00:00","updated_at":"2026-05-18T01:22:45.747219+00:00"}