{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E7JSB7TNMZFMIBWRGAPZ67S6SR","short_pith_number":"pith:E7JSB7TN","canonical_record":{"source":{"id":"1610.00300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-10-02T16:12:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"703f64c808440df0857fe046de64ca7722c8cfe38817c84116360995ad55f45c","abstract_canon_sha256":"538ed22ee0875142c035b43754ab229e556672128921b2635f95a9a3a7dbf86e"},"schema_version":"1.0"},"canonical_sha256":"27d320fe6d664ac406d1301f9f7e5e946f94444c087b7411ac2c00be32a320e4","source":{"kind":"arxiv","id":"1610.00300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00300","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00300v1","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00300","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"E7JSB7TNMZFM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E7JSB7TNMZFMIBWR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E7JSB7TN","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E7JSB7TNMZFMIBWRGAPZ67S6SR","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-10-02T16:12:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"703f64c808440df0857fe046de64ca7722c8cfe38817c84116360995ad55f45c","abstract_canon_sha256":"538ed22ee0875142c035b43754ab229e556672128921b2635f95a9a3a7dbf86e"},"schema_version":"1.0"},"canonical_sha256":"27d320fe6d664ac406d1301f9f7e5e946f94444c087b7411ac2c00be32a320e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:25.829051Z","signature_b64":"Th0WqVI1s6Di/peEe/uVbZS0sH0q9A0mje+ba4qPDXK0eUkFg/0Tv+ponazBkRd1P/J+qgiBsIiK74gRWl42BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d320fe6d664ac406d1301f9f7e5e946f94444c087b7411ac2c00be32a320e4","last_reissued_at":"2026-05-18T01:03:25.828368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:25.828368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00300","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LbagPcHMprY/WT5yJw03NfP1vY8XrXpjLf/QDAfQ3f10hrtQWuVJXnE2cGRlFcotriaw7JDKsTSzz/3eeTODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:55:38.858842Z"},"content_sha256":"ac81b85c6de02c4b0d7e987ca68f3782c1618cc9bd2dc41863612a11a2859c9a","schema_version":"1.0","event_id":"sha256:ac81b85c6de02c4b0d7e987ca68f3782c1618cc9bd2dc41863612a11a2859c9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E7JSB7TNMZFMIBWRGAPZ67S6SR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Time Algorithms for Bichromatic Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Aritra Banik, Sayan Bandyapadhyay","submitted_at":"2016-10-02T16:12:07Z","abstract_excerpt":"In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these problems is two fold; (i) these problems appear naturally and frequently in the fields like Machine learning, Data mining, and so on, and (ii) we are interested in extending the algorithms and techniques for single point set (monochromatic) problems to bichromatic case. For all the problems considered in this paper, we design low polynomial time exact algorithms. These algorithms are based on novel techn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00300","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKWz/rjARFS9uDp3osvBNEW9XkHyCTk3lRctvPhpXzX3rR7rekQSbXSSGdV/SHYAKZuRrVEDKk8ACkLiTakCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:55:38.859284Z"},"content_sha256":"d4a51e410fac57b9e3df748d2400a05b5f58bef00433288bf4e42c37895b6020","schema_version":"1.0","event_id":"sha256:d4a51e410fac57b9e3df748d2400a05b5f58bef00433288bf4e42c37895b6020"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7JSB7TNMZFMIBWRGAPZ67S6SR/bundle.json","state_url":"https://pith.science/pith/E7JSB7TNMZFMIBWRGAPZ67S6SR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7JSB7TNMZFMIBWRGAPZ67S6SR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T03:55:38Z","links":{"resolver":"https://pith.science/pith/E7JSB7TNMZFMIBWRGAPZ67S6SR","bundle":"https://pith.science/pith/E7JSB7TNMZFMIBWRGAPZ67S6SR/bundle.json","state":"https://pith.science/pith/E7JSB7TNMZFMIBWRGAPZ67S6SR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7JSB7TNMZFMIBWRGAPZ67S6SR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E7JSB7TNMZFMIBWRGAPZ67S6SR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"538ed22ee0875142c035b43754ab229e556672128921b2635f95a9a3a7dbf86e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-10-02T16:12:07Z","title_canon_sha256":"703f64c808440df0857fe046de64ca7722c8cfe38817c84116360995ad55f45c"},"schema_version":"1.0","source":{"id":"1610.00300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00300","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00300v1","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00300","created_at":"2026-05-18T01:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"E7JSB7TNMZFM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E7JSB7TNMZFMIBWR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E7JSB7TN","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:d4a51e410fac57b9e3df748d2400a05b5f58bef00433288bf4e42c37895b6020","target":"graph","created_at":"2026-05-18T01:03:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these problems is two fold; (i) these problems appear naturally and frequently in the fields like Machine learning, Data mining, and so on, and (ii) we are interested in extending the algorithms and techniques for single point set (monochromatic) problems to bichromatic case. For all the problems considered in this paper, we design low polynomial time exact algorithms. These algorithms are based on novel techn","authors_text":"Aritra Banik, Sayan Bandyapadhyay","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-10-02T16:12:07Z","title":"Polynomial Time Algorithms for Bichromatic Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00300","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ac81b85c6de02c4b0d7e987ca68f3782c1618cc9bd2dc41863612a11a2859c9a","target":"record","created_at":"2026-05-18T01:03:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"538ed22ee0875142c035b43754ab229e556672128921b2635f95a9a3a7dbf86e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-10-02T16:12:07Z","title_canon_sha256":"703f64c808440df0857fe046de64ca7722c8cfe38817c84116360995ad55f45c"},"schema_version":"1.0","source":{"id":"1610.00300","kind":"arxiv","version":1}},"canonical_sha256":"27d320fe6d664ac406d1301f9f7e5e946f94444c087b7411ac2c00be32a320e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d320fe6d664ac406d1301f9f7e5e946f94444c087b7411ac2c00be32a320e4","first_computed_at":"2026-05-18T01:03:25.828368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:25.828368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Th0WqVI1s6Di/peEe/uVbZS0sH0q9A0mje+ba4qPDXK0eUkFg/0Tv+ponazBkRd1P/J+qgiBsIiK74gRWl42BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:25.829051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac81b85c6de02c4b0d7e987ca68f3782c1618cc9bd2dc41863612a11a2859c9a","sha256:d4a51e410fac57b9e3df748d2400a05b5f58bef00433288bf4e42c37895b6020"],"state_sha256":"f39f745d23e993f7a90b9d5ec2ad6bbea01e67efdb5be65425a707acfc2abb58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1tEGvyI7LBka1wS61x0O6MNSklqvOFMedbaJAp1k+VQyDk4BgYn4tTy+BU9yzIBr46hIKfg9+vpJqzoV6O7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:55:38.862401Z","bundle_sha256":"843e6a7f678540f234c1650f02319814a26a27750ae1956ba4116c199fd5cea4"}}