{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L7VH5NKUVAJNXP7MI33L5IZ5WB","short_pith_number":"pith:L7VH5NKU","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"},"canonical_sha256":"5fea7eb554a812dbbfec46f6bea33db0677ccb85d920f43985e1c5241b67bb4f","source":{"kind":"arxiv","id":"1208.4225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4225","created_at":"2026-05-18T03:48:24Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4225v1","created_at":"2026-05-18T03:48:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4225","created_at":"2026-05-18T03:48:24Z"},{"alias_kind":"pith_short_12","alias_value":"L7VH5NKUVAJN","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L7VH5NKUVAJNXP7M","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L7VH5NKU","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L7VH5NKUVAJNXP7MI33L5IZ5WB","target":"record","payload":{"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"},"canonical_sha256":"5fea7eb554a812dbbfec46f6bea33db0677ccb85d920f43985e1c5241b67bb4f","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"},"source_kind":"arxiv","source_id":"1208.4225","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-18T03:48:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIdtWHsJECHP1Gx4qfDl6XQBtYrlNpQjleAd7nZjR9thKSETPTMcKw8l+KztSWH/o8e+Xeb4Qeu3vSfiWPl6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T23:03:04.417243Z"},"content_sha256":"3fecc73bddf4833761cf17c4332a800817791f76b6faaf8f9e9b99e3aeaef84f","schema_version":"1.0","event_id":"sha256:3fecc73bddf4833761cf17c4332a800817791f76b6faaf8f9e9b99e3aeaef84f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L7VH5NKUVAJNXP7MI33L5IZ5WB","target":"graph","payload":{"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"},"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-18T03:48:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOCQsARUAqYdFYFYpiuh8nvkegsm4ZnREWpAcvpNYTTEc7YTMNKL61yQGzpybkfjQYtBfufjpgmegoPXYjrNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T23:03:04.417604Z"},"content_sha256":"02db80db715d772825d58b0322359c1c55dc62f742a0f28c08fd426938bf3cde","schema_version":"1.0","event_id":"sha256:02db80db715d772825d58b0322359c1c55dc62f742a0f28c08fd426938bf3cde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB/bundle.json","state_url":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB/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-06-27T23:03:04Z","links":{"resolver":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB","bundle":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB/bundle.json","state":"https://pith.science/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7VH5NKUVAJNXP7MI33L5IZ5WB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L7VH5NKUVAJNXP7MI33L5IZ5WB","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":"32eed101f976100bfc41406430c3cc380bb8cb1f35dbdbfeb87d2752fc4117d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-21T09:28:50Z","title_canon_sha256":"65b1d23074139ce147fc699825eb09d27d557b15780ee56eddeb9ac24ea916b5"},"schema_version":"1.0","source":{"id":"1208.4225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4225","created_at":"2026-05-18T03:48:24Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4225v1","created_at":"2026-05-18T03:48:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4225","created_at":"2026-05-18T03:48:24Z"},{"alias_kind":"pith_short_12","alias_value":"L7VH5NKUVAJN","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L7VH5NKUVAJNXP7M","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L7VH5NKU","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:02db80db715d772825d58b0322359c1c55dc62f742a0f28c08fd426938bf3cde","target":"graph","created_at":"2026-05-18T03:48:24Z","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":"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","authors_text":"Erik Jan van Leeuwen, Jesper Nederlof, Ruben van der Zwaan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-21T09:28:50Z","title":"Reducing a Target Interval to a Few Exact Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4225","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:3fecc73bddf4833761cf17c4332a800817791f76b6faaf8f9e9b99e3aeaef84f","target":"record","created_at":"2026-05-18T03:48:24Z","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":"32eed101f976100bfc41406430c3cc380bb8cb1f35dbdbfeb87d2752fc4117d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-21T09:28:50Z","title_canon_sha256":"65b1d23074139ce147fc699825eb09d27d557b15780ee56eddeb9ac24ea916b5"},"schema_version":"1.0","source":{"id":"1208.4225","kind":"arxiv","version":1}},"canonical_sha256":"5fea7eb554a812dbbfec46f6bea33db0677ccb85d920f43985e1c5241b67bb4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fea7eb554a812dbbfec46f6bea33db0677ccb85d920f43985e1c5241b67bb4f","first_computed_at":"2026-05-18T03:48:24.075875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:24.075875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9KAQxJ8yBrhy2aDJxVCmYKpoHiIAjcROPZbdN2rVUEIEYx/VJBrfkOK8RBpLQUKdWfQ+feqUEZY12A/3CS6pDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:24.076537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.4225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fecc73bddf4833761cf17c4332a800817791f76b6faaf8f9e9b99e3aeaef84f","sha256:02db80db715d772825d58b0322359c1c55dc62f742a0f28c08fd426938bf3cde"],"state_sha256":"7ec011b8a0da01376eac12337f60f66f55efabd8f096fe3bf21a49eb8dadb24f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mECFbAA2GlEWn5ZbDgmIQ9nNwgguOkXAh2rqlxju9n4eOdXxinO8X2NmXDmb+U9OxE4v6Mx1ykqymeuToTmNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T23:03:04.419441Z","bundle_sha256":"e41236e95a717641c88b759746c5c3646899af2c37b058fc8fe1d9be8a8c7178"}}