{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NB4RWTRAAUGXVTAELODY2EQEGT","short_pith_number":"pith:NB4RWTRA","schema_version":"1.0","canonical_sha256":"68791b4e20050d7acc045b878d120434d05a1e4ef892f348eb19b4d699e55128","source":{"kind":"arxiv","id":"1011.4888","version":1},"attestation_state":"computed","paper":{"title":"On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids","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":"2010-11-22T17:55:20Z","abstract_excerpt":"The heterochromatic number hc(H) of a non-empty hypergraph H is the smallest integer k such that for every colouring of the vertices of H with exactly k colours, there is a hyperedge of H all of whose vertices have different colours. We denote by nu(H) the number of vertices of H and by tau(H) the size of the smallest set containing at least two vertices of each hyperedge of H. For a complete geometric graph G with n > 2 vertices let H = H(G) be the hypergraph whose vertices are the edges of G and whose hyperedges are the edge sets of plane spanning trees of G. We prove that if G has at most o"},"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":"1011.4888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-22T17:55:20Z","cross_cats_sorted":[],"title_canon_sha256":"8823ac3698903c13519c9b898b6ce5ee3b0cced49af875920aced9785fbeeb62","abstract_canon_sha256":"64a74391bf15d8c2283e73b867323d25a45ad4f9fee858d931144996b2d24681"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:55.155957Z","signature_b64":"IooMBEFxlwGHXfnKNjWCMw4L6AbsWZWmfXCPmsx98CpTqwLEh6mMyVKDw+SjhMB8KvBgvalJJ+gFY/bqbIGLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68791b4e20050d7acc045b878d120434d05a1e4ef892f348eb19b4d699e55128","last_reissued_at":"2026-05-18T01:27:55.155310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:55.155310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids","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":"2010-11-22T17:55:20Z","abstract_excerpt":"The heterochromatic number hc(H) of a non-empty hypergraph H is the smallest integer k such that for every colouring of the vertices of H with exactly k colours, there is a hyperedge of H all of whose vertices have different colours. We denote by nu(H) the number of vertices of H and by tau(H) the size of the smallest set containing at least two vertices of each hyperedge of H. For a complete geometric graph G with n > 2 vertices let H = H(G) be the hypergraph whose vertices are the edges of G and whose hyperedges are the edge sets of plane spanning trees of G. We prove that if G has at most o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4888","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":"1011.4888","created_at":"2026-05-18T01:27:55.155440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4888v1","created_at":"2026-05-18T01:27:55.155440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4888","created_at":"2026-05-18T01:27:55.155440+00:00"},{"alias_kind":"pith_short_12","alias_value":"NB4RWTRAAUGX","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NB4RWTRAAUGXVTAE","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NB4RWTRA","created_at":"2026-05-18T12:26:10.704358+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/NB4RWTRAAUGXVTAELODY2EQEGT","json":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT.json","graph_json":"https://pith.science/api/pith-number/NB4RWTRAAUGXVTAELODY2EQEGT/graph.json","events_json":"https://pith.science/api/pith-number/NB4RWTRAAUGXVTAELODY2EQEGT/events.json","paper":"https://pith.science/paper/NB4RWTRA"},"agent_actions":{"view_html":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT","download_json":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT.json","view_paper":"https://pith.science/paper/NB4RWTRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4888&json=true","fetch_graph":"https://pith.science/api/pith-number/NB4RWTRAAUGXVTAELODY2EQEGT/graph.json","fetch_events":"https://pith.science/api/pith-number/NB4RWTRAAUGXVTAELODY2EQEGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT/action/storage_attestation","attest_author":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT/action/author_attestation","sign_citation":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT/action/citation_signature","submit_replication":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT/action/replication_record"}},"created_at":"2026-05-18T01:27:55.155440+00:00","updated_at":"2026-05-18T01:27:55.155440+00:00"}