{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ATG3GFK2DZHZYSQKBTEL4O2KDO","short_pith_number":"pith:ATG3GFK2","canonical_record":{"source":{"id":"1704.04773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-16T13:13:28Z","cross_cats_sorted":[],"title_canon_sha256":"4310a6a8259065a315575c2d5595c2fb160707f5836c5749f3f6d0821cae99c4","abstract_canon_sha256":"6a522e486644a3bf7c6358e1f808be2f770f8434a4835f49ee82f828ac258b57"},"schema_version":"1.0"},"canonical_sha256":"04cdb3155a1e4f9c4a0a0cc8be3b4a1bb7ec3d18c174379a315309e82b16e679","source":{"kind":"arxiv","id":"1704.04773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04773","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04773v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04773","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"ATG3GFK2DZHZ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"ATG3GFK2DZHZYSQK","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"ATG3GFK2","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ATG3GFK2DZHZYSQKBTEL4O2KDO","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-16T13:13:28Z","cross_cats_sorted":[],"title_canon_sha256":"4310a6a8259065a315575c2d5595c2fb160707f5836c5749f3f6d0821cae99c4","abstract_canon_sha256":"6a522e486644a3bf7c6358e1f808be2f770f8434a4835f49ee82f828ac258b57"},"schema_version":"1.0"},"canonical_sha256":"04cdb3155a1e4f9c4a0a0cc8be3b4a1bb7ec3d18c174379a315309e82b16e679","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:17.771932Z","signature_b64":"7sP4DQXXmuVAKNiNPV8ymT2g49rbtMqVRLoWiY/p+7GFgL9F8tA88AOb5MRWGGGPr3aVt4xGdhTmXwcelqiqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04cdb3155a1e4f9c4a0a0cc8be3b4a1bb7ec3d18c174379a315309e82b16e679","last_reissued_at":"2026-05-18T00:46:17.771277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:17.771277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04773","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-18T00:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgYMCP+cEVqPY4QfwtRtBn+r/6MNrPK4QJGq18fBQndWsZLFLdnI8Gf2ZsNkBu4/HDQ4fuv7DLGoifWFDh5+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:00:44.072698Z"},"content_sha256":"076ac4fc29d5acef52679a47e48bf26eb4d9c670cab71d5cdfcc206efbbf2748","schema_version":"1.0","event_id":"sha256:076ac4fc29d5acef52679a47e48bf26eb4d9c670cab71d5cdfcc206efbbf2748"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ATG3GFK2DZHZYSQKBTEL4O2KDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Backbone Based Multilevel Algorithm for Next Release Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"He Jiang, Jifeng Xuan, Zhilei Ren","submitted_at":"2017-04-16T13:13:28Z","abstract_excerpt":"The next release problem (NRP) aims to effectively select software requirements in order to acquire maximum customer profits. As an NP-hard problem in software requirement engineering, NRP lacks efficient approximate algorithms for large scale instances. The backbone is a new tool for tackling large scale NP-hard problems in recent years. In this paper, we employ the backbone to design high performance approximate algorithms for large scale NRP instances. Firstly we show that it is NP-hard to obtain the backbone of NRP. Then, we illustrate by fitness landscape analysis that the backbone can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04773","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-18T00:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9ZNzNCn8aOItfzXsGpwpQK70hmAm6Lp29kzLoSuL2BG1ttKHR9cx9tMsCSpuQLZm3V1IttWwpb5Z+eHCroxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:00:44.073419Z"},"content_sha256":"8532a8e8c7f37ef1e932146a4b9ec496144455b1cb4897e5359975a4059b277c","schema_version":"1.0","event_id":"sha256:8532a8e8c7f37ef1e932146a4b9ec496144455b1cb4897e5359975a4059b277c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATG3GFK2DZHZYSQKBTEL4O2KDO/bundle.json","state_url":"https://pith.science/pith/ATG3GFK2DZHZYSQKBTEL4O2KDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATG3GFK2DZHZYSQKBTEL4O2KDO/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-28T19:00:44Z","links":{"resolver":"https://pith.science/pith/ATG3GFK2DZHZYSQKBTEL4O2KDO","bundle":"https://pith.science/pith/ATG3GFK2DZHZYSQKBTEL4O2KDO/bundle.json","state":"https://pith.science/pith/ATG3GFK2DZHZYSQKBTEL4O2KDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATG3GFK2DZHZYSQKBTEL4O2KDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ATG3GFK2DZHZYSQKBTEL4O2KDO","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":"6a522e486644a3bf7c6358e1f808be2f770f8434a4835f49ee82f828ac258b57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-16T13:13:28Z","title_canon_sha256":"4310a6a8259065a315575c2d5595c2fb160707f5836c5749f3f6d0821cae99c4"},"schema_version":"1.0","source":{"id":"1704.04773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04773","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04773v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04773","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"ATG3GFK2DZHZ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"ATG3GFK2DZHZYSQK","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"ATG3GFK2","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:8532a8e8c7f37ef1e932146a4b9ec496144455b1cb4897e5359975a4059b277c","target":"graph","created_at":"2026-05-18T00:46:17Z","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 next release problem (NRP) aims to effectively select software requirements in order to acquire maximum customer profits. As an NP-hard problem in software requirement engineering, NRP lacks efficient approximate algorithms for large scale instances. The backbone is a new tool for tackling large scale NP-hard problems in recent years. In this paper, we employ the backbone to design high performance approximate algorithms for large scale NRP instances. Firstly we show that it is NP-hard to obtain the backbone of NRP. Then, we illustrate by fitness landscape analysis that the backbone can be","authors_text":"He Jiang, Jifeng Xuan, Zhilei Ren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-16T13:13:28Z","title":"Approximate Backbone Based Multilevel Algorithm for Next Release Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04773","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:076ac4fc29d5acef52679a47e48bf26eb4d9c670cab71d5cdfcc206efbbf2748","target":"record","created_at":"2026-05-18T00:46:17Z","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":"6a522e486644a3bf7c6358e1f808be2f770f8434a4835f49ee82f828ac258b57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-16T13:13:28Z","title_canon_sha256":"4310a6a8259065a315575c2d5595c2fb160707f5836c5749f3f6d0821cae99c4"},"schema_version":"1.0","source":{"id":"1704.04773","kind":"arxiv","version":1}},"canonical_sha256":"04cdb3155a1e4f9c4a0a0cc8be3b4a1bb7ec3d18c174379a315309e82b16e679","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04cdb3155a1e4f9c4a0a0cc8be3b4a1bb7ec3d18c174379a315309e82b16e679","first_computed_at":"2026-05-18T00:46:17.771277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:17.771277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7sP4DQXXmuVAKNiNPV8ymT2g49rbtMqVRLoWiY/p+7GFgL9F8tA88AOb5MRWGGGPr3aVt4xGdhTmXwcelqiqCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:17.771932Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:076ac4fc29d5acef52679a47e48bf26eb4d9c670cab71d5cdfcc206efbbf2748","sha256:8532a8e8c7f37ef1e932146a4b9ec496144455b1cb4897e5359975a4059b277c"],"state_sha256":"76907aa3e47e9d8c0fbe557eb2652444cc0f7a1d19b2e3eb4a09a673cac16993"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjQ3V8NpJkMgS0eUoymRVK6o5Cq7Qd7JYClUqa+1sTQQGVoGI1dx4vjKFNnCkUVd42EJRKBUMzCAiB76MXt2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:00:44.079150Z","bundle_sha256":"cd6ecfd78ef419e040b5abb35e36755cb5182c922fab00ad1e77bd41449941a2"}}