{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FT3ESL7YQTXXNE5XLIVPM7YHZI","short_pith_number":"pith:FT3ESL7Y","schema_version":"1.0","canonical_sha256":"2cf6492ff884ef7693b75a2af67f07ca044f8162a437927301ee8df36ac7510a","source":{"kind":"arxiv","id":"1708.06062","version":1},"attestation_state":"computed","paper":{"title":"Balanced partitions of 3-colored geometric sets in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Carlos Seara, Dolores Lara, Ferran Hurtado, Jorge Urrutia, Kevin Verbeek, Matias Korman, Mikio Kano, Rodrigo I. Silveira, Sergey Bereg","submitted_at":"2017-08-21T02:27:50Z","abstract_excerpt":"Let $S$ be a finite set of geometric objects partitioned into classes or \\emph{colors}. A subset $S'\\subseteq S$ is said to be \\emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several problems on partitioning $3$-colored sets of points and lines in the plane into two balanced subsets: (a) We prove that for every 3-colored arrangement of lines there exists a segment that intersects exactly one line of each color, and that when there are $2m$ lines of each color, there is a segment intercepting $m$ lines of each color. (b) Given $n$ red points"},"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":"1708.06062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-21T02:27:50Z","cross_cats_sorted":[],"title_canon_sha256":"87ab951ac8f3706c59d49dcb1c7c1a68429aaf08fa64cb0dcea21390e98db7ef","abstract_canon_sha256":"7b6e31493a52e78e312f7d147e7c7966699d4b9c7c48ce0a3d688c4e520cc3cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:43.374564Z","signature_b64":"3P582EcTDpv+Gp5JkkfeqUXEIS9tkzSJPecjWT+HZwUwZFJ8PKH5WEX0T/aXZPjbySs09q/vtrsEoFdQJ9u0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cf6492ff884ef7693b75a2af67f07ca044f8162a437927301ee8df36ac7510a","last_reissued_at":"2026-05-18T00:37:43.373813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:43.373813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balanced partitions of 3-colored geometric sets in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Carlos Seara, Dolores Lara, Ferran Hurtado, Jorge Urrutia, Kevin Verbeek, Matias Korman, Mikio Kano, Rodrigo I. Silveira, Sergey Bereg","submitted_at":"2017-08-21T02:27:50Z","abstract_excerpt":"Let $S$ be a finite set of geometric objects partitioned into classes or \\emph{colors}. A subset $S'\\subseteq S$ is said to be \\emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several problems on partitioning $3$-colored sets of points and lines in the plane into two balanced subsets: (a) We prove that for every 3-colored arrangement of lines there exists a segment that intersects exactly one line of each color, and that when there are $2m$ lines of each color, there is a segment intercepting $m$ lines of each color. (b) Given $n$ red points"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06062","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":"1708.06062","created_at":"2026-05-18T00:37:43.373930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06062v1","created_at":"2026-05-18T00:37:43.373930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06062","created_at":"2026-05-18T00:37:43.373930+00:00"},{"alias_kind":"pith_short_12","alias_value":"FT3ESL7YQTXX","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FT3ESL7YQTXXNE5X","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FT3ESL7Y","created_at":"2026-05-18T12:31:15.632608+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/FT3ESL7YQTXXNE5XLIVPM7YHZI","json":"https://pith.science/pith/FT3ESL7YQTXXNE5XLIVPM7YHZI.json","graph_json":"https://pith.science/api/pith-number/FT3ESL7YQTXXNE5XLIVPM7YHZI/graph.json","events_json":"https://pith.science/api/pith-number/FT3ESL7YQTXXNE5XLIVPM7YHZI/events.json","paper":"https://pith.science/paper/FT3ESL7Y"},"agent_actions":{"view_html":"https://pith.science/pith/FT3ESL7YQTXXNE5XLIVPM7YHZI","download_json":"https://pith.science/pith/FT3ESL7YQTXXNE5XLIVPM7YHZI.json","view_paper":"https://pith.science/paper/FT3ESL7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06062&json=true","fetch_graph":"https://pith.science/api/pith-number/FT3ESL7YQTXXNE5XLIVPM7YHZI/graph.json","fetch_events":"https://pith.science/api/pith-number/FT3ESL7YQTXXNE5XLIVPM7YHZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FT3ESL7YQTXXNE5XLIVPM7YHZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FT3ESL7YQTXXNE5XLIVPM7YHZI/action/storage_attestation","attest_author":"https://pith.science/pith/FT3ESL7YQTXXNE5XLIVPM7YHZI/action/author_attestation","sign_citation":"https://pith.science/pith/FT3ESL7YQTXXNE5XLIVPM7YHZI/action/citation_signature","submit_replication":"https://pith.science/pith/FT3ESL7YQTXXNE5XLIVPM7YHZI/action/replication_record"}},"created_at":"2026-05-18T00:37:43.373930+00:00","updated_at":"2026-05-18T00:37:43.373930+00:00"}