{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HIPHLZAJ46CCIGR54E3VFBBWK5","short_pith_number":"pith:HIPHLZAJ","canonical_record":{"source":{"id":"1307.7089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-26T16:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"1e5882d3b961c3b1d4ddbb2fa4473c5bf74beeb5a60b1ac2cb61ea22484018da","abstract_canon_sha256":"3a8f4d9f0d038faa1d853acadb9a1dd4931eaa1af667bf87588a780623dea3fc"},"schema_version":"1.0"},"canonical_sha256":"3a1e75e409e784241a3de1375284365768abdb09f86da5af5f3440e4b0fa3673","source":{"kind":"arxiv","id":"1307.7089","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7089","created_at":"2026-05-18T03:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7089v1","created_at":"2026-05-18T03:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7089","created_at":"2026-05-18T03:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"HIPHLZAJ46CC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HIPHLZAJ46CCIGR5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HIPHLZAJ","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HIPHLZAJ46CCIGR54E3VFBBWK5","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-26T16:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"1e5882d3b961c3b1d4ddbb2fa4473c5bf74beeb5a60b1ac2cb61ea22484018da","abstract_canon_sha256":"3a8f4d9f0d038faa1d853acadb9a1dd4931eaa1af667bf87588a780623dea3fc"},"schema_version":"1.0"},"canonical_sha256":"3a1e75e409e784241a3de1375284365768abdb09f86da5af5f3440e4b0fa3673","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:25.381243Z","signature_b64":"QkwR9mYz1WzInar/0m6qJQlu0L/MT8pWDjF2dOn//OM9E4kkIDl+877NHg40Mi1I7QwCeOyawaD/2TGDkPxABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a1e75e409e784241a3de1375284365768abdb09f86da5af5f3440e4b0fa3673","last_reissued_at":"2026-05-18T03:17:25.380672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:25.380672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7089","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:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRBalaYHh607h5mOaVrYZcL9nf7FkmHPM4DmX1X3Kr+zbV6ZbhjzDSp0HAasG/KcdB2DZU3KWG4/DyF7RwjvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:58:43.693230Z"},"content_sha256":"884ed7376051828a9771a71e392a85d6ab6c2781c292f53f2e7cec1bf8478d4f","schema_version":"1.0","event_id":"sha256:884ed7376051828a9771a71e392a85d6ab6c2781c292f53f2e7cec1bf8478d4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HIPHLZAJ46CCIGR54E3VFBBWK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An approximation algorithm for the Bandpass-2 problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guohui Lin, Jiuping Xu, Lusheng Wang, Randy Goebel, Weitian Tong, Yinfeng Xu, Zhi-Zhong Chen","submitted_at":"2013-07-26T16:46:04Z","abstract_excerpt":"The general Bandpass-$B$ problem is NP-hard and can be approximated by a reduction into the weighted $B$-set packing problem, with a worst case performance ratio of $O(B^2)$. When $B = 2$, a maximum weight matching gives a 2-approximation to the problem. In this paper, we call the Bandpass-2 problem simply the Bandpass problem. The Bandpass problem can be viewed as a variation of the maximum traveling salesman problem, in which the edge weights are dynamic rather than given at the front. We present a ${426}{227}$-approximation algorithm for the problem. Such an improved approximation is built "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7089","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:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fkozZ8f//GnCbmMrFvSOMGJGZLLyxpPckFoiteTToakXyLMPpefAq1hrEkSXjrLGxzvpCl+2Pp5g3yO6FrTODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:58:43.693641Z"},"content_sha256":"d393b429a1ce161888dd62d4b75193eb39746989780ce9ffc43aeb47c75caa3f","schema_version":"1.0","event_id":"sha256:d393b429a1ce161888dd62d4b75193eb39746989780ce9ffc43aeb47c75caa3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HIPHLZAJ46CCIGR54E3VFBBWK5/bundle.json","state_url":"https://pith.science/pith/HIPHLZAJ46CCIGR54E3VFBBWK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HIPHLZAJ46CCIGR54E3VFBBWK5/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-25T05:58:43Z","links":{"resolver":"https://pith.science/pith/HIPHLZAJ46CCIGR54E3VFBBWK5","bundle":"https://pith.science/pith/HIPHLZAJ46CCIGR54E3VFBBWK5/bundle.json","state":"https://pith.science/pith/HIPHLZAJ46CCIGR54E3VFBBWK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HIPHLZAJ46CCIGR54E3VFBBWK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HIPHLZAJ46CCIGR54E3VFBBWK5","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":"3a8f4d9f0d038faa1d853acadb9a1dd4931eaa1af667bf87588a780623dea3fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-26T16:46:04Z","title_canon_sha256":"1e5882d3b961c3b1d4ddbb2fa4473c5bf74beeb5a60b1ac2cb61ea22484018da"},"schema_version":"1.0","source":{"id":"1307.7089","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7089","created_at":"2026-05-18T03:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7089v1","created_at":"2026-05-18T03:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7089","created_at":"2026-05-18T03:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"HIPHLZAJ46CC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HIPHLZAJ46CCIGR5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HIPHLZAJ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:d393b429a1ce161888dd62d4b75193eb39746989780ce9ffc43aeb47c75caa3f","target":"graph","created_at":"2026-05-18T03:17: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":"The general Bandpass-$B$ problem is NP-hard and can be approximated by a reduction into the weighted $B$-set packing problem, with a worst case performance ratio of $O(B^2)$. When $B = 2$, a maximum weight matching gives a 2-approximation to the problem. In this paper, we call the Bandpass-2 problem simply the Bandpass problem. The Bandpass problem can be viewed as a variation of the maximum traveling salesman problem, in which the edge weights are dynamic rather than given at the front. We present a ${426}{227}$-approximation algorithm for the problem. Such an improved approximation is built ","authors_text":"Guohui Lin, Jiuping Xu, Lusheng Wang, Randy Goebel, Weitian Tong, Yinfeng Xu, Zhi-Zhong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-26T16:46:04Z","title":"An approximation algorithm for the Bandpass-2 problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7089","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:884ed7376051828a9771a71e392a85d6ab6c2781c292f53f2e7cec1bf8478d4f","target":"record","created_at":"2026-05-18T03:17: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":"3a8f4d9f0d038faa1d853acadb9a1dd4931eaa1af667bf87588a780623dea3fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-26T16:46:04Z","title_canon_sha256":"1e5882d3b961c3b1d4ddbb2fa4473c5bf74beeb5a60b1ac2cb61ea22484018da"},"schema_version":"1.0","source":{"id":"1307.7089","kind":"arxiv","version":1}},"canonical_sha256":"3a1e75e409e784241a3de1375284365768abdb09f86da5af5f3440e4b0fa3673","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a1e75e409e784241a3de1375284365768abdb09f86da5af5f3440e4b0fa3673","first_computed_at":"2026-05-18T03:17:25.380672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:25.380672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QkwR9mYz1WzInar/0m6qJQlu0L/MT8pWDjF2dOn//OM9E4kkIDl+877NHg40Mi1I7QwCeOyawaD/2TGDkPxABA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:25.381243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7089","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:884ed7376051828a9771a71e392a85d6ab6c2781c292f53f2e7cec1bf8478d4f","sha256:d393b429a1ce161888dd62d4b75193eb39746989780ce9ffc43aeb47c75caa3f"],"state_sha256":"b990d32606e9a286aacdb68500d79313abcbd54b552b947783bd9c40bca8544a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"av7W4PfLA3p04BUkYcpMu7kqnq3xxzi77LLiMLDptZPPOxPLGoDRHhx5NuJkAUkeNpazipgClIN8cpbXGQDGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:58:43.698554Z","bundle_sha256":"8dc01f31fdacc3cd7922bfa5c86a9e419573ce50dca7d4da7f4cfe2247f506e4"}}