{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:45OBCQUOM7VLY7ZMFC2TBAW4QG","short_pith_number":"pith:45OBCQUO","canonical_record":{"source":{"id":"1704.04777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-04-16T13:43:51Z","cross_cats_sorted":[],"title_canon_sha256":"0cbcd726d9ea943405fcde56c7eab9161096095d4dcdcc9cc8e54ec0b2bfd16e","abstract_canon_sha256":"27c5e92a33a785ca367fd327b63b439c1ca22d4dc17bb065dc210048a56f5cec"},"schema_version":"1.0"},"canonical_sha256":"e75c11428e67eabc7f2c28b53082dc818d610f67e6b36c32f91f642b9fb3835b","source":{"kind":"arxiv","id":"1704.04777","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04777","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04777v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04777","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"45OBCQUOM7VL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"45OBCQUOM7VLY7ZM","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"45OBCQUO","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:45OBCQUOM7VLY7ZMFC2TBAW4QG","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-04-16T13:43:51Z","cross_cats_sorted":[],"title_canon_sha256":"0cbcd726d9ea943405fcde56c7eab9161096095d4dcdcc9cc8e54ec0b2bfd16e","abstract_canon_sha256":"27c5e92a33a785ca367fd327b63b439c1ca22d4dc17bb065dc210048a56f5cec"},"schema_version":"1.0"},"canonical_sha256":"e75c11428e67eabc7f2c28b53082dc818d610f67e6b36c32f91f642b9fb3835b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:17.750161Z","signature_b64":"AhjvzcnC1tdBguv/RtdpfnZ/GnjoHd747h6fxQM9XB5rfChVqcPUmJk4oPYRNHhVim06ZJgNHrre6/i39LGTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e75c11428e67eabc7f2c28b53082dc818d610f67e6b36c32f91f642b9fb3835b","last_reissued_at":"2026-05-18T00:46:17.749648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:17.749648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04777","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":"dKwCdnm08xahyGUX/YHdbWhlsOFvEWx0y1O6jSE3j27WRimdNr9FHrmFmg44pa2ofErpTPxPLD34YYbh5hy6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:39:35.698280Z"},"content_sha256":"7d5c323cbf8e287b115fdf201eaffea3cfeb115b67e7fb2953ac8cc69dfdacdd","schema_version":"1.0","event_id":"sha256:7d5c323cbf8e287b115fdf201eaffea3cfeb115b67e7fb2953ac8cc69dfdacdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:45OBCQUOM7VLY7ZMFC2TBAW4QG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hybrid ACO Algorithm for the Next Release Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"He Jiang, Jifeng Xuan, Jingyuan Zhang, Yan Hu, Zhilei Ren","submitted_at":"2017-04-16T13:43:51Z","abstract_excerpt":"In this paper, we propose a Hybrid Ant Colony Optimization algorithm (HACO) for Next Release Problem (NRP). NRP, a NP-hard problem in requirement engineering, is to balance customer requests, resource constraints, and requirement dependencies by requirement selection. Inspired by the successes of Ant Colony Optimization algorithms (ACO) for solving NP-hard problems, we design our HACO to approximately solve NRP. Similar to traditional ACO algorithms, multiple artificial ants are employed to construct new solutions. During the solution construction phase, both pheromone trails and neighborhood "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04777","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":"Dn3r3P1EEFcfwYE+bzUoqE/1mAhv+fvTXipeoInoiu0slo+P8FiQ2529zMYcXMfbsh3/A3H3BUtDke5EG7MTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:39:35.698639Z"},"content_sha256":"f3f8648a78db675e999a69998f3a807959f7c69098d119c262dd277197585336","schema_version":"1.0","event_id":"sha256:f3f8648a78db675e999a69998f3a807959f7c69098d119c262dd277197585336"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45OBCQUOM7VLY7ZMFC2TBAW4QG/bundle.json","state_url":"https://pith.science/pith/45OBCQUOM7VLY7ZMFC2TBAW4QG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45OBCQUOM7VLY7ZMFC2TBAW4QG/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-04T15:39:35Z","links":{"resolver":"https://pith.science/pith/45OBCQUOM7VLY7ZMFC2TBAW4QG","bundle":"https://pith.science/pith/45OBCQUOM7VLY7ZMFC2TBAW4QG/bundle.json","state":"https://pith.science/pith/45OBCQUOM7VLY7ZMFC2TBAW4QG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45OBCQUOM7VLY7ZMFC2TBAW4QG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:45OBCQUOM7VLY7ZMFC2TBAW4QG","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":"27c5e92a33a785ca367fd327b63b439c1ca22d4dc17bb065dc210048a56f5cec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-04-16T13:43:51Z","title_canon_sha256":"0cbcd726d9ea943405fcde56c7eab9161096095d4dcdcc9cc8e54ec0b2bfd16e"},"schema_version":"1.0","source":{"id":"1704.04777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04777","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04777v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04777","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"45OBCQUOM7VL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"45OBCQUOM7VLY7ZM","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"45OBCQUO","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:f3f8648a78db675e999a69998f3a807959f7c69098d119c262dd277197585336","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":"In this paper, we propose a Hybrid Ant Colony Optimization algorithm (HACO) for Next Release Problem (NRP). NRP, a NP-hard problem in requirement engineering, is to balance customer requests, resource constraints, and requirement dependencies by requirement selection. Inspired by the successes of Ant Colony Optimization algorithms (ACO) for solving NP-hard problems, we design our HACO to approximately solve NRP. Similar to traditional ACO algorithms, multiple artificial ants are employed to construct new solutions. During the solution construction phase, both pheromone trails and neighborhood ","authors_text":"He Jiang, Jifeng Xuan, Jingyuan Zhang, Yan Hu, Zhilei Ren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-04-16T13:43:51Z","title":"A Hybrid ACO Algorithm for the Next Release Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04777","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:7d5c323cbf8e287b115fdf201eaffea3cfeb115b67e7fb2953ac8cc69dfdacdd","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":"27c5e92a33a785ca367fd327b63b439c1ca22d4dc17bb065dc210048a56f5cec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-04-16T13:43:51Z","title_canon_sha256":"0cbcd726d9ea943405fcde56c7eab9161096095d4dcdcc9cc8e54ec0b2bfd16e"},"schema_version":"1.0","source":{"id":"1704.04777","kind":"arxiv","version":1}},"canonical_sha256":"e75c11428e67eabc7f2c28b53082dc818d610f67e6b36c32f91f642b9fb3835b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e75c11428e67eabc7f2c28b53082dc818d610f67e6b36c32f91f642b9fb3835b","first_computed_at":"2026-05-18T00:46:17.749648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:17.749648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AhjvzcnC1tdBguv/RtdpfnZ/GnjoHd747h6fxQM9XB5rfChVqcPUmJk4oPYRNHhVim06ZJgNHrre6/i39LGTDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:17.750161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d5c323cbf8e287b115fdf201eaffea3cfeb115b67e7fb2953ac8cc69dfdacdd","sha256:f3f8648a78db675e999a69998f3a807959f7c69098d119c262dd277197585336"],"state_sha256":"e9a48e33923b9908930ea27806690c3b347ad25d6a02da5945cc044f6a1e9e07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hUZt2TN/ZsMX9wB96/HL35qr0/Z/kXGeo6pu3b4xW2LzhClFUcAT7ph25XaeH/ZYiavsb58tBe3FS84aKB2WDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:39:35.700570Z","bundle_sha256":"45d33a5aa8091022d743be792f757da62d567698d2913f73e7cb9737c7a021eb"}}