{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GEVIBQ6YAO2I5VERIK37QTP4TP","short_pith_number":"pith:GEVIBQ6Y","schema_version":"1.0","canonical_sha256":"312a80c3d803b48ed49142b7f84dfc9be2ab189ed5988adcd3830040f5ef0849","source":{"kind":"arxiv","id":"1501.02285","version":2},"attestation_state":"computed","paper":{"title":"Interval Selection in the Streaming Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pablo P\\'erez-Lantero, Sergio Cabello","submitted_at":"2015-01-09T22:52:21Z","abstract_excerpt":"A set of intervals is independent when the intervals are pairwise disjoint. In the interval selection problem we are given a set $\\mathbb{I}$ of intervals and we want to find an independent subset of intervals of largest cardinality. Let $\\alpha(\\mathbb{I})$ denote the cardinality of an optimal solution. We discuss the estimation of $\\alpha(\\mathbb{I})$ in the streaming model, where we only have one-time, sequential access to the input intervals, the endpoints of the intervals lie in $\\{1,...,n \\}$, and the amount of the memory is constrained.\n  For intervals of different sizes, we provide an "},"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":"1501.02285","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-09T22:52:21Z","cross_cats_sorted":[],"title_canon_sha256":"a8caba03e368438aa2f4656d8ce4166166d1c0740b310d2d4a3a953059919524","abstract_canon_sha256":"c89c56cf99dfa06f4c9dda6f198a811a7791efe74e3761f03cb8fd781cc746d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:58.314920Z","signature_b64":"iw6tcvpPnPFpKioOsrmALLgOURwaSuKlIpkiOFoNNqRe851sa7lE6eFkYNU52AQZFUZvOZQXxnAbLedmixdpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"312a80c3d803b48ed49142b7f84dfc9be2ab189ed5988adcd3830040f5ef0849","last_reissued_at":"2026-05-18T02:27:58.314307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:58.314307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interval Selection in the Streaming Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pablo P\\'erez-Lantero, Sergio Cabello","submitted_at":"2015-01-09T22:52:21Z","abstract_excerpt":"A set of intervals is independent when the intervals are pairwise disjoint. In the interval selection problem we are given a set $\\mathbb{I}$ of intervals and we want to find an independent subset of intervals of largest cardinality. Let $\\alpha(\\mathbb{I})$ denote the cardinality of an optimal solution. We discuss the estimation of $\\alpha(\\mathbb{I})$ in the streaming model, where we only have one-time, sequential access to the input intervals, the endpoints of the intervals lie in $\\{1,...,n \\}$, and the amount of the memory is constrained.\n  For intervals of different sizes, we provide an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02285","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":"1501.02285","created_at":"2026-05-18T02:27:58.314416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02285v2","created_at":"2026-05-18T02:27:58.314416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02285","created_at":"2026-05-18T02:27:58.314416+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEVIBQ6YAO2I","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEVIBQ6YAO2I5VER","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEVIBQ6Y","created_at":"2026-05-18T12:29:22.688609+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/GEVIBQ6YAO2I5VERIK37QTP4TP","json":"https://pith.science/pith/GEVIBQ6YAO2I5VERIK37QTP4TP.json","graph_json":"https://pith.science/api/pith-number/GEVIBQ6YAO2I5VERIK37QTP4TP/graph.json","events_json":"https://pith.science/api/pith-number/GEVIBQ6YAO2I5VERIK37QTP4TP/events.json","paper":"https://pith.science/paper/GEVIBQ6Y"},"agent_actions":{"view_html":"https://pith.science/pith/GEVIBQ6YAO2I5VERIK37QTP4TP","download_json":"https://pith.science/pith/GEVIBQ6YAO2I5VERIK37QTP4TP.json","view_paper":"https://pith.science/paper/GEVIBQ6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02285&json=true","fetch_graph":"https://pith.science/api/pith-number/GEVIBQ6YAO2I5VERIK37QTP4TP/graph.json","fetch_events":"https://pith.science/api/pith-number/GEVIBQ6YAO2I5VERIK37QTP4TP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEVIBQ6YAO2I5VERIK37QTP4TP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEVIBQ6YAO2I5VERIK37QTP4TP/action/storage_attestation","attest_author":"https://pith.science/pith/GEVIBQ6YAO2I5VERIK37QTP4TP/action/author_attestation","sign_citation":"https://pith.science/pith/GEVIBQ6YAO2I5VERIK37QTP4TP/action/citation_signature","submit_replication":"https://pith.science/pith/GEVIBQ6YAO2I5VERIK37QTP4TP/action/replication_record"}},"created_at":"2026-05-18T02:27:58.314416+00:00","updated_at":"2026-05-18T02:27:58.314416+00:00"}