{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7QCUSW5ETGME3MG6PFGHBNDHLF","short_pith_number":"pith:7QCUSW5E","schema_version":"1.0","canonical_sha256":"fc05495ba499984db0de794c70b4675972cfa36d66bf021b0b184dd5267ff206","source":{"kind":"arxiv","id":"1205.5162","version":2},"attestation_state":"computed","paper":{"title":"Coloring and Guarding Arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ferran Hurtado, Jean Cardinal, Matias Korman, Perouz Taslakian, Prosenjit Bose, S\\'ebastien Collette, Stefan Langerman","submitted_at":"2012-05-23T12:04:01Z","abstract_excerpt":"Given an arrangement of lines in the plane, what is the minimum number $c$ of colors required to color the lines so that no cell of the arrangement is monochromatic? In this paper we give bounds on the number c both for the above question, as well as some of its variations. We redefine these problems as geometric hypergraph coloring problems. If we define $\\Hlinecell$ as the hypergraph where vertices are lines and edges represent cells of the arrangement, the answer to the above question is equal to the chromatic number of this hypergraph. We prove that this chromatic number is between $\\Omega"},"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.5162","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-05-23T12:04:01Z","cross_cats_sorted":[],"title_canon_sha256":"8bbb85afd8756766212165edf2cf7b4a5d85d7f5fa3cfe09a683bfe708d59a0b","abstract_canon_sha256":"69c19799de5bbe502be53d6849d34500a2e1d92de867922c1d7d1aabe50e853b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:14.748798Z","signature_b64":"0WaftU0tDlMvADBmIjFraoD+ehHxTQYKPgKgIWPZRHf2WILM9vM125jDdfS/lhrvjtf1iDjZE1c/DWkxErQfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc05495ba499984db0de794c70b4675972cfa36d66bf021b0b184dd5267ff206","last_reissued_at":"2026-05-18T03:54:14.748265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:14.748265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring and Guarding Arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ferran Hurtado, Jean Cardinal, Matias Korman, Perouz Taslakian, Prosenjit Bose, S\\'ebastien Collette, Stefan Langerman","submitted_at":"2012-05-23T12:04:01Z","abstract_excerpt":"Given an arrangement of lines in the plane, what is the minimum number $c$ of colors required to color the lines so that no cell of the arrangement is monochromatic? In this paper we give bounds on the number c both for the above question, as well as some of its variations. We redefine these problems as geometric hypergraph coloring problems. If we define $\\Hlinecell$ as the hypergraph where vertices are lines and edges represent cells of the arrangement, the answer to the above question is equal to the chromatic number of this hypergraph. We prove that this chromatic number is between $\\Omega"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5162","kind":"arxiv","version":2},"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.5162","created_at":"2026-05-18T03:54:14.748345+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.5162v2","created_at":"2026-05-18T03:54:14.748345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5162","created_at":"2026-05-18T03:54:14.748345+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QCUSW5ETGME","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QCUSW5ETGME3MG6","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QCUSW5E","created_at":"2026-05-18T12:26:58.693483+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/7QCUSW5ETGME3MG6PFGHBNDHLF","json":"https://pith.science/pith/7QCUSW5ETGME3MG6PFGHBNDHLF.json","graph_json":"https://pith.science/api/pith-number/7QCUSW5ETGME3MG6PFGHBNDHLF/graph.json","events_json":"https://pith.science/api/pith-number/7QCUSW5ETGME3MG6PFGHBNDHLF/events.json","paper":"https://pith.science/paper/7QCUSW5E"},"agent_actions":{"view_html":"https://pith.science/pith/7QCUSW5ETGME3MG6PFGHBNDHLF","download_json":"https://pith.science/pith/7QCUSW5ETGME3MG6PFGHBNDHLF.json","view_paper":"https://pith.science/paper/7QCUSW5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.5162&json=true","fetch_graph":"https://pith.science/api/pith-number/7QCUSW5ETGME3MG6PFGHBNDHLF/graph.json","fetch_events":"https://pith.science/api/pith-number/7QCUSW5ETGME3MG6PFGHBNDHLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QCUSW5ETGME3MG6PFGHBNDHLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QCUSW5ETGME3MG6PFGHBNDHLF/action/storage_attestation","attest_author":"https://pith.science/pith/7QCUSW5ETGME3MG6PFGHBNDHLF/action/author_attestation","sign_citation":"https://pith.science/pith/7QCUSW5ETGME3MG6PFGHBNDHLF/action/citation_signature","submit_replication":"https://pith.science/pith/7QCUSW5ETGME3MG6PFGHBNDHLF/action/replication_record"}},"created_at":"2026-05-18T03:54:14.748345+00:00","updated_at":"2026-05-18T03:54:14.748345+00:00"}