{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Y6XSNP2IW4MFRGXWCLY76S62XF","short_pith_number":"pith:Y6XSNP2I","schema_version":"1.0","canonical_sha256":"c7af26bf48b718589af612f1ff4bdab953140edfabd90b801446cf1098ee7903","source":{"kind":"arxiv","id":"1606.07156","version":1},"attestation_state":"computed","paper":{"title":"A New View of Classification in Astronomy with the Archetype Technique: An Astronomical Case of the NP-complete Set Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.GA"],"primary_cat":"astro-ph.IM","authors_text":"Guangtun Zhu (JHU)","submitted_at":"2016-06-23T01:26:44Z","abstract_excerpt":"We introduce a new generic Archetype technique for source classification and identification, based on the NP-complete set cover problem (SCP) in computer science and operations research (OR). We have developed a new heuristic SCP solver, by combining the greedy algorithm and the Lagrangian Relaxation (LR) approximation method. We test the performance of our code on the test cases from Beasley's OR Library and show that our SCP solver can efficiently yield solutions that are on average 99% optimal in terms of the cost. We discuss how to adopt SCP for classification purposes and put forward a ne"},"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":"1606.07156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2016-06-23T01:26:44Z","cross_cats_sorted":["astro-ph.GA"],"title_canon_sha256":"6dea45cb9289af526e847d097af21306aec7a3062487658c7bd6cd4be5d13ba9","abstract_canon_sha256":"88811d2ef0a59eebd314980ba0eddca22d95cc9c0bd82ba69e6252c37acd7a5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:58.566803Z","signature_b64":"dvYgVkOAoGQsbGHYr6PxYhEHnfSMggkvMSrSHFpNL81e1WPi5ZP6y0KoUjrFZnwy6gwK08RgZPA9S8SZZv2NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7af26bf48b718589af612f1ff4bdab953140edfabd90b801446cf1098ee7903","last_reissued_at":"2026-05-18T01:11:58.566471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:58.566471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New View of Classification in Astronomy with the Archetype Technique: An Astronomical Case of the NP-complete Set Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.GA"],"primary_cat":"astro-ph.IM","authors_text":"Guangtun Zhu (JHU)","submitted_at":"2016-06-23T01:26:44Z","abstract_excerpt":"We introduce a new generic Archetype technique for source classification and identification, based on the NP-complete set cover problem (SCP) in computer science and operations research (OR). We have developed a new heuristic SCP solver, by combining the greedy algorithm and the Lagrangian Relaxation (LR) approximation method. We test the performance of our code on the test cases from Beasley's OR Library and show that our SCP solver can efficiently yield solutions that are on average 99% optimal in terms of the cost. We discuss how to adopt SCP for classification purposes and put forward a ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07156","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":"1606.07156","created_at":"2026-05-18T01:11:58.566525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07156v1","created_at":"2026-05-18T01:11:58.566525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07156","created_at":"2026-05-18T01:11:58.566525+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6XSNP2IW4MF","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6XSNP2IW4MFRGXW","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6XSNP2I","created_at":"2026-05-18T12:30:53.716459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06037","citing_title":"A virtually connected probabilistic computer as a solver for higher-order, densely connected, or reconfigurable combinatorial optimisation problems","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y6XSNP2IW4MFRGXWCLY76S62XF","json":"https://pith.science/pith/Y6XSNP2IW4MFRGXWCLY76S62XF.json","graph_json":"https://pith.science/api/pith-number/Y6XSNP2IW4MFRGXWCLY76S62XF/graph.json","events_json":"https://pith.science/api/pith-number/Y6XSNP2IW4MFRGXWCLY76S62XF/events.json","paper":"https://pith.science/paper/Y6XSNP2I"},"agent_actions":{"view_html":"https://pith.science/pith/Y6XSNP2IW4MFRGXWCLY76S62XF","download_json":"https://pith.science/pith/Y6XSNP2IW4MFRGXWCLY76S62XF.json","view_paper":"https://pith.science/paper/Y6XSNP2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07156&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6XSNP2IW4MFRGXWCLY76S62XF/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6XSNP2IW4MFRGXWCLY76S62XF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6XSNP2IW4MFRGXWCLY76S62XF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6XSNP2IW4MFRGXWCLY76S62XF/action/storage_attestation","attest_author":"https://pith.science/pith/Y6XSNP2IW4MFRGXWCLY76S62XF/action/author_attestation","sign_citation":"https://pith.science/pith/Y6XSNP2IW4MFRGXWCLY76S62XF/action/citation_signature","submit_replication":"https://pith.science/pith/Y6XSNP2IW4MFRGXWCLY76S62XF/action/replication_record"}},"created_at":"2026-05-18T01:11:58.566525+00:00","updated_at":"2026-05-18T01:11:58.566525+00:00"}