{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DANHX5KFY4SUJULPFFLASEUAXS","short_pith_number":"pith:DANHX5KF","schema_version":"1.0","canonical_sha256":"181a7bf545c72544d16f2956091280bcbc90de64b5226e10a59911ca54c4a868","source":{"kind":"arxiv","id":"1805.02538","version":1},"attestation_state":"computed","paper":{"title":"Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Aleksandar Markovic, Boris Aronov, Gerhard Woeginger, Mark de Berg","submitted_at":"2018-05-07T14:19:08Z","abstract_excerpt":"It is well known that any set of n intervals in $\\mathbb{R}^1$ admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more complex 1-dimensional spaces, namely so-called tree spaces and planar network spaces."},"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":"1805.02538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-07T14:19:08Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"02ca3b25ad42670e2812928c2df880e6586cfeb8c3dea68fb5791d65c046be1a","abstract_canon_sha256":"4e8f90b8344ed8e820715628c35e7138b789ca3b4bf9f26d45c170b41e13dbcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:39.695362Z","signature_b64":"WJnUWV3sNcagvPCI5RjPPnM7TH+smLXHOtgCvN72wPMKCt9sLNBYGDJlghrwqCrZqufV+nkya9o5+YjzKKeFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"181a7bf545c72544d16f2956091280bcbc90de64b5226e10a59911ca54c4a868","last_reissued_at":"2026-05-18T00:16:39.694720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:39.694720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Aleksandar Markovic, Boris Aronov, Gerhard Woeginger, Mark de Berg","submitted_at":"2018-05-07T14:19:08Z","abstract_excerpt":"It is well known that any set of n intervals in $\\mathbb{R}^1$ admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more complex 1-dimensional spaces, namely so-called tree spaces and planar network spaces."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02538","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":"1805.02538","created_at":"2026-05-18T00:16:39.694828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02538v1","created_at":"2026-05-18T00:16:39.694828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02538","created_at":"2026-05-18T00:16:39.694828+00:00"},{"alias_kind":"pith_short_12","alias_value":"DANHX5KFY4SU","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DANHX5KFY4SUJULP","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DANHX5KF","created_at":"2026-05-18T12:32:19.392346+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/DANHX5KFY4SUJULPFFLASEUAXS","json":"https://pith.science/pith/DANHX5KFY4SUJULPFFLASEUAXS.json","graph_json":"https://pith.science/api/pith-number/DANHX5KFY4SUJULPFFLASEUAXS/graph.json","events_json":"https://pith.science/api/pith-number/DANHX5KFY4SUJULPFFLASEUAXS/events.json","paper":"https://pith.science/paper/DANHX5KF"},"agent_actions":{"view_html":"https://pith.science/pith/DANHX5KFY4SUJULPFFLASEUAXS","download_json":"https://pith.science/pith/DANHX5KFY4SUJULPFFLASEUAXS.json","view_paper":"https://pith.science/paper/DANHX5KF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02538&json=true","fetch_graph":"https://pith.science/api/pith-number/DANHX5KFY4SUJULPFFLASEUAXS/graph.json","fetch_events":"https://pith.science/api/pith-number/DANHX5KFY4SUJULPFFLASEUAXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DANHX5KFY4SUJULPFFLASEUAXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DANHX5KFY4SUJULPFFLASEUAXS/action/storage_attestation","attest_author":"https://pith.science/pith/DANHX5KFY4SUJULPFFLASEUAXS/action/author_attestation","sign_citation":"https://pith.science/pith/DANHX5KFY4SUJULPFFLASEUAXS/action/citation_signature","submit_replication":"https://pith.science/pith/DANHX5KFY4SUJULPFFLASEUAXS/action/replication_record"}},"created_at":"2026-05-18T00:16:39.694828+00:00","updated_at":"2026-05-18T00:16:39.694828+00:00"}