{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:L7VH5NKUVAJNXP7MI33L5IZ5WB","short_pith_number":"pith:L7VH5NKU","schema_version":"1.0","canonical_sha256":"5fea7eb554a812dbbfec46f6bea33db0677ccb85d920f43985e1c5241b67bb4f","source":{"kind":"arxiv","id":"1208.4225","version":1},"attestation_state":"computed","paper":{"title":"Reducing a Target Interval to a Few Exact Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik Jan van Leeuwen, Jesper Nederlof, Ruben van der Zwaan","submitted_at":"2012-08-21T09:28:50Z","abstract_excerpt":"Many combinatorial problems involving weights can be formulated as a so-called ranged problem. That is, their input consists of a universe $U$, a (succinctly-represented) set family $\\mathcal{F} \\subseteq 2^{U}$, a weight function $\\omega:U \\rightarrow \\{1,...,N\\}$, and integers $0 \\leq l \\leq u \\leq \\infty$. Then the problem is to decide whether there is an $X \\in \\mathcal{F}$ such that $l \\leq \\sum_{e \\in X}\\omega(e) \\leq u$. Well-known examples of such problems include Knapsack, Subset Sum, Maximum Matching, and Traveling Salesman. In this paper, we develop a generic method to transform a r"},"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":"1208.4225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-21T09:28:50Z","cross_cats_sorted":[],"title_canon_sha256":"65b1d23074139ce147fc699825eb09d27d557b15780ee56eddeb9ac24ea916b5","abstract_canon_sha256":"32eed101f976100bfc41406430c3cc380bb8cb1f35dbdbfeb87d2752fc4117d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:24.076537Z","signature_b64":"9KAQxJ8yBrhy2aDJxVCmYKpoHiIAjcROPZbdN2rVUEIEYx/VJBrfkOK8RBpLQUKdWfQ+feqUEZY12A/3CS6pDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fea7eb554a812dbbfec46f6bea33db0677ccb85d920f43985e1c5241b67bb4f","last_reissued_at":"2026-05-18T03:48:24.075875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:24.075875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing a Target Interval to a Few Exact Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik Jan van Leeuwen, Jesper Nederlof, Ruben van der Zwaan","submitted_at":"2012-08-21T09:28:50Z","abstract_excerpt":"Many combinatorial problems involving weights can be formulated as a so-called ranged problem. That is, their input consists of a universe $U$, a (succinctly-represented) set family $\\mathcal{F} \\subseteq 2^{U}$, a weight function $\\omega:U \\rightarrow \\{1,...,N\\}$, and integers $0 \\leq l \\leq u \\leq \\infty$. Then the problem is to decide whether there is an $X \\in \\mathcal{F}$ such that $l \\leq \\sum_{e \\in X}\\omega(e) \\leq u$. Well-known examples of such problems include Knapsack, Subset Sum, Maximum Matching, and Traveling Salesman. In this paper, we develop a generic method to transform a r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4225","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":"1208.4225","created_at":"2026-05-18T03:48:24.075978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.4225v1","created_at":"2026-05-18T03:48:24.075978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4225","created_at":"2026-05-18T03:48:24.075978+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7VH5NKUVAJN","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7VH5NKUVAJNXP7M","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7VH5NKU","created_at":"2026-05-18T12:27:14.488303+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/L7VH5NKUVAJNXP7MI33L5IZ5WB","json":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB.json","graph_json":"https://pith.science/api/pith-number/L7VH5NKUVAJNXP7MI33L5IZ5WB/graph.json","events_json":"https://pith.science/api/pith-number/L7VH5NKUVAJNXP7MI33L5IZ5WB/events.json","paper":"https://pith.science/paper/L7VH5NKU"},"agent_actions":{"view_html":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB","download_json":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB.json","view_paper":"https://pith.science/paper/L7VH5NKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.4225&json=true","fetch_graph":"https://pith.science/api/pith-number/L7VH5NKUVAJNXP7MI33L5IZ5WB/graph.json","fetch_events":"https://pith.science/api/pith-number/L7VH5NKUVAJNXP7MI33L5IZ5WB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB/action/storage_attestation","attest_author":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB/action/author_attestation","sign_citation":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB/action/citation_signature","submit_replication":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB/action/replication_record"}},"created_at":"2026-05-18T03:48:24.075978+00:00","updated_at":"2026-05-18T03:48:24.075978+00:00"}