{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WGSLRAMDZCHGXBTB6DK5WQTTWO","short_pith_number":"pith:WGSLRAMD","schema_version":"1.0","canonical_sha256":"b1a4b88183c88e6b8661f0d5db4273b3930aff7d8ee084bc2c01182f89d2c035","source":{"kind":"arxiv","id":"1205.1900","version":1},"attestation_state":"computed","paper":{"title":"Strong Conflict-Free Coloring of Intervals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Adele A. Rescigno, Luisa Gargano","submitted_at":"2012-05-09T08:06:18Z","abstract_excerpt":"We consider the k-strong conflict-free coloring of a set of points on a line with respect to a family of intervals: Each point on the line must be assigned a color so that the coloring has to be conflict-free, in the sense that in every interval I there are at least k colors each appearing exactly once in I. In this paper, we present a polynomial algorithm for the general problem; the algorithm has an approximation factor 5-2/k when k\\geq2 and approximation factor 2 for k=1. In the special case the family contains all the possible intervals on the given set of points, we show that a 2 approxim"},"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":"1205.1900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-09T08:06:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"425247f2997a06f2743c7fa07b94da99ee83f57dd6e25d6a584b84830cad309a","abstract_canon_sha256":"a54b4825bcf9893394626deac1e049c4ea62e59f2470a14a484224e8b0e7bb7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:10.494263Z","signature_b64":"wiRpnncWsxPrC8j9BEJQRcHlpnR1c4tePRblPtczPKINEQNKzqVfp2JOm84cjgTuGT24ukzu3gEQG289U+uCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1a4b88183c88e6b8661f0d5db4273b3930aff7d8ee084bc2c01182f89d2c035","last_reissued_at":"2026-05-18T02:21:10.493717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:10.493717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Conflict-Free Coloring of Intervals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Adele A. Rescigno, Luisa Gargano","submitted_at":"2012-05-09T08:06:18Z","abstract_excerpt":"We consider the k-strong conflict-free coloring of a set of points on a line with respect to a family of intervals: Each point on the line must be assigned a color so that the coloring has to be conflict-free, in the sense that in every interval I there are at least k colors each appearing exactly once in I. In this paper, we present a polynomial algorithm for the general problem; the algorithm has an approximation factor 5-2/k when k\\geq2 and approximation factor 2 for k=1. In the special case the family contains all the possible intervals on the given set of points, we show that a 2 approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1900","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":"1205.1900","created_at":"2026-05-18T02:21:10.493815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1900v1","created_at":"2026-05-18T02:21:10.493815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1900","created_at":"2026-05-18T02:21:10.493815+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGSLRAMDZCHG","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGSLRAMDZCHGXBTB","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGSLRAMD","created_at":"2026-05-18T12:27:25.539911+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/WGSLRAMDZCHGXBTB6DK5WQTTWO","json":"https://pith.science/pith/WGSLRAMDZCHGXBTB6DK5WQTTWO.json","graph_json":"https://pith.science/api/pith-number/WGSLRAMDZCHGXBTB6DK5WQTTWO/graph.json","events_json":"https://pith.science/api/pith-number/WGSLRAMDZCHGXBTB6DK5WQTTWO/events.json","paper":"https://pith.science/paper/WGSLRAMD"},"agent_actions":{"view_html":"https://pith.science/pith/WGSLRAMDZCHGXBTB6DK5WQTTWO","download_json":"https://pith.science/pith/WGSLRAMDZCHGXBTB6DK5WQTTWO.json","view_paper":"https://pith.science/paper/WGSLRAMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1900&json=true","fetch_graph":"https://pith.science/api/pith-number/WGSLRAMDZCHGXBTB6DK5WQTTWO/graph.json","fetch_events":"https://pith.science/api/pith-number/WGSLRAMDZCHGXBTB6DK5WQTTWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGSLRAMDZCHGXBTB6DK5WQTTWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGSLRAMDZCHGXBTB6DK5WQTTWO/action/storage_attestation","attest_author":"https://pith.science/pith/WGSLRAMDZCHGXBTB6DK5WQTTWO/action/author_attestation","sign_citation":"https://pith.science/pith/WGSLRAMDZCHGXBTB6DK5WQTTWO/action/citation_signature","submit_replication":"https://pith.science/pith/WGSLRAMDZCHGXBTB6DK5WQTTWO/action/replication_record"}},"created_at":"2026-05-18T02:21:10.493815+00:00","updated_at":"2026-05-18T02:21:10.493815+00:00"}