{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:F5AZR7GEYGCP7YD53GAW75E3IB","short_pith_number":"pith:F5AZR7GE","schema_version":"1.0","canonical_sha256":"2f4198fcc4c184ffe07dd9816ff49b4066222ee760b75f7ee263b1df399fff2e","source":{"kind":"arxiv","id":"1309.3696","version":2},"attestation_state":"computed","paper":{"title":"Matching colored points with rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"C. Ochoa, J. Rojas-Ledesma, L. E. Caraballo, P. P\\'erez-Lantero","submitted_at":"2013-09-14T19:46:35Z","abstract_excerpt":"Let $S$ be a point set in the plane such that each of its elements is colored either red or blue. A matching of $S$ with rectangles is any set of pairwise-disjoint axis-aligned rectangles such that each rectangle contains exactly two points of $S$. Such a matching is monochromatic if every rectangle contains points of the same color, and is bichromatic if every rectangle contains points of different colors. In this paper we study the following two problems:\n  1. Find a maximum monochromatic matching of $S$ with rectangles.\n  2. Find a maximum bichromatic matching of $S$ with rectangles.\n  For "},"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":"1309.3696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-09-14T19:46:35Z","cross_cats_sorted":[],"title_canon_sha256":"6ab43b88ecd362bb6b0d55e3dca11b3c3177cff3d269a26e0a31e807eedb4bd5","abstract_canon_sha256":"0c5a7998b37be7d6e01a07218c3a4e56559b1532cf05077e8ce2147311fc2113"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:22.063064Z","signature_b64":"LY6FXPmtjX+k3937SujNPPI/04a6uJCfKJ8untq4I2DdrTXQ7k0a4crTWp7wKxncNSrRvEK0NZO3yixDBGgMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f4198fcc4c184ffe07dd9816ff49b4066222ee760b75f7ee263b1df399fff2e","last_reissued_at":"2026-05-18T03:03:22.062657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:22.062657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching colored points with rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"C. Ochoa, J. Rojas-Ledesma, L. E. Caraballo, P. P\\'erez-Lantero","submitted_at":"2013-09-14T19:46:35Z","abstract_excerpt":"Let $S$ be a point set in the plane such that each of its elements is colored either red or blue. A matching of $S$ with rectangles is any set of pairwise-disjoint axis-aligned rectangles such that each rectangle contains exactly two points of $S$. Such a matching is monochromatic if every rectangle contains points of the same color, and is bichromatic if every rectangle contains points of different colors. In this paper we study the following two problems:\n  1. Find a maximum monochromatic matching of $S$ with rectangles.\n  2. Find a maximum bichromatic matching of $S$ with rectangles.\n  For "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3696","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":"1309.3696","created_at":"2026-05-18T03:03:22.062715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.3696v2","created_at":"2026-05-18T03:03:22.062715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3696","created_at":"2026-05-18T03:03:22.062715+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5AZR7GEYGCP","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5AZR7GEYGCP7YD5","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5AZR7GE","created_at":"2026-05-18T12:27:43.054852+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/F5AZR7GEYGCP7YD53GAW75E3IB","json":"https://pith.science/pith/F5AZR7GEYGCP7YD53GAW75E3IB.json","graph_json":"https://pith.science/api/pith-number/F5AZR7GEYGCP7YD53GAW75E3IB/graph.json","events_json":"https://pith.science/api/pith-number/F5AZR7GEYGCP7YD53GAW75E3IB/events.json","paper":"https://pith.science/paper/F5AZR7GE"},"agent_actions":{"view_html":"https://pith.science/pith/F5AZR7GEYGCP7YD53GAW75E3IB","download_json":"https://pith.science/pith/F5AZR7GEYGCP7YD53GAW75E3IB.json","view_paper":"https://pith.science/paper/F5AZR7GE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.3696&json=true","fetch_graph":"https://pith.science/api/pith-number/F5AZR7GEYGCP7YD53GAW75E3IB/graph.json","fetch_events":"https://pith.science/api/pith-number/F5AZR7GEYGCP7YD53GAW75E3IB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5AZR7GEYGCP7YD53GAW75E3IB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5AZR7GEYGCP7YD53GAW75E3IB/action/storage_attestation","attest_author":"https://pith.science/pith/F5AZR7GEYGCP7YD53GAW75E3IB/action/author_attestation","sign_citation":"https://pith.science/pith/F5AZR7GEYGCP7YD53GAW75E3IB/action/citation_signature","submit_replication":"https://pith.science/pith/F5AZR7GEYGCP7YD53GAW75E3IB/action/replication_record"}},"created_at":"2026-05-18T03:03:22.062715+00:00","updated_at":"2026-05-18T03:03:22.062715+00:00"}