{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:NB4RWTRAAUGXVTAELODY2EQEGT","short_pith_number":"pith:NB4RWTRA","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"},"canonical_sha256":"68791b4e20050d7acc045b878d120434d05a1e4ef892f348eb19b4d699e55128","source":{"kind":"arxiv","id":"1011.4888","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4888","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4888v1","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4888","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"NB4RWTRAAUGX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NB4RWTRAAUGXVTAE","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NB4RWTRA","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:NB4RWTRAAUGXVTAELODY2EQEGT","target":"record","payload":{"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"},"canonical_sha256":"68791b4e20050d7acc045b878d120434d05a1e4ef892f348eb19b4d699e55128","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"},"source_kind":"arxiv","source_id":"1011.4888","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-18T01:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nyXOeJhtaFsSetSwJnUgmfcjKrfDXQ39FEJTJjJyhDtA7cBut8nGhX2RjghvJ+mLrN+q0UWWn4LZDG8z/zylAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:27:30.774715Z"},"content_sha256":"91ed7e5eda44f83149dd64cfc32c20428e2196fdb4476ac5986def119d261b7f","schema_version":"1.0","event_id":"sha256:91ed7e5eda44f83149dd64cfc32c20428e2196fdb4476ac5986def119d261b7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:NB4RWTRAAUGXVTAELODY2EQEGT","target":"graph","payload":{"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"},"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-18T01:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNOO6zHqa43Tdsb5wjmm5b1SW46HJFWu0qavQm2Mr9uXnQrDmYezSQgTpXlxRTLnuTYHQrolCDQMemQ+WiMtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:27:30.775259Z"},"content_sha256":"a8aa3e22f11ebd67018d40c3a4b9aa55bcf8a677427974fbcdfece00eb64c1d7","schema_version":"1.0","event_id":"sha256:a8aa3e22f11ebd67018d40c3a4b9aa55bcf8a677427974fbcdfece00eb64c1d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT/bundle.json","state_url":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NB4RWTRAAUGXVTAELODY2EQEGT/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-26T00:27:30Z","links":{"resolver":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT","bundle":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT/bundle.json","state":"https://pith.science/pith/NB4RWTRAAUGXVTAELODY2EQEGT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NB4RWTRAAUGXVTAELODY2EQEGT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NB4RWTRAAUGXVTAELODY2EQEGT","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":"64a74391bf15d8c2283e73b867323d25a45ad4f9fee858d931144996b2d24681","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-22T17:55:20Z","title_canon_sha256":"8823ac3698903c13519c9b898b6ce5ee3b0cced49af875920aced9785fbeeb62"},"schema_version":"1.0","source":{"id":"1011.4888","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4888","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4888v1","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4888","created_at":"2026-05-18T01:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"NB4RWTRAAUGX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NB4RWTRAAUGXVTAE","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NB4RWTRA","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:a8aa3e22f11ebd67018d40c3a4b9aa55bcf8a677427974fbcdfece00eb64c1d7","target":"graph","created_at":"2026-05-18T01:27:55Z","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":"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","authors_text":"Eduardo Rivera-Campo, Juan Jos\\'e Montellano-Ballesteros","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-22T17:55:20Z","title":"On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4888","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:91ed7e5eda44f83149dd64cfc32c20428e2196fdb4476ac5986def119d261b7f","target":"record","created_at":"2026-05-18T01:27:55Z","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":"64a74391bf15d8c2283e73b867323d25a45ad4f9fee858d931144996b2d24681","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-22T17:55:20Z","title_canon_sha256":"8823ac3698903c13519c9b898b6ce5ee3b0cced49af875920aced9785fbeeb62"},"schema_version":"1.0","source":{"id":"1011.4888","kind":"arxiv","version":1}},"canonical_sha256":"68791b4e20050d7acc045b878d120434d05a1e4ef892f348eb19b4d699e55128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68791b4e20050d7acc045b878d120434d05a1e4ef892f348eb19b4d699e55128","first_computed_at":"2026-05-18T01:27:55.155310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:55.155310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IooMBEFxlwGHXfnKNjWCMw4L6AbsWZWmfXCPmsx98CpTqwLEh6mMyVKDw+SjhMB8KvBgvalJJ+gFY/bqbIGLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:55.155957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4888","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91ed7e5eda44f83149dd64cfc32c20428e2196fdb4476ac5986def119d261b7f","sha256:a8aa3e22f11ebd67018d40c3a4b9aa55bcf8a677427974fbcdfece00eb64c1d7"],"state_sha256":"84123da200df89ff8bf9b6c1dac6a5bbb1000557ef8fd5e3e780fb8f3133a78f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7OHvGV539xOQnUWKflHwr4+rD2bodiLM0ZiJscWK9SEdLzYdQkwU7lpaObgm668SU1T0etAQCL3XvYoBQdRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:27:30.778144Z","bundle_sha256":"850fbbef88252fa9baeb825b53916e11ae09d3c03383e037174b7d387fab69ff"}}