{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:P4S6Q72535M7XKL2LQFR2VLE74","short_pith_number":"pith:P4S6Q725","schema_version":"1.0","canonical_sha256":"7f25e87f5ddf59fba97a5c0b1d5564ff0dfedf5f2f9c65adf8a12cacc7867ff5","source":{"kind":"arxiv","id":"1510.04796","version":1},"attestation_state":"computed","paper":{"title":"Improved Solution to the Non-Domination Level Update Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Samrat Mondal, Sriparna Saha, Sumit Mishra","submitted_at":"2015-10-16T06:53:19Z","abstract_excerpt":"Non-domination level update problem is to sort the non-dominated fronts after insertion or deletion of a solution. Generally the solution to this problem requires to perform the complete non-dominated sorting which is too expensive in terms of number of comparisons. Recently an Efficient Non-domination Level Update (ENLU) approach is proposed which does not perform the complete sorting. For this purpose, in this paper a space efficient version of ENLU approach is proposed without compromising the number of comparisons. However this approach does not work satisfactorily in all the cases. So we "},"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":"1510.04796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-16T06:53:19Z","cross_cats_sorted":[],"title_canon_sha256":"bf51199f10bd102e01308e52b838550ea532c6872c24965d643578e84766f1ad","abstract_canon_sha256":"51dbdc38f68b863d3f32dcf03f2bd0ace1fb0f10946fb8484610300e78fd863e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:00.604277Z","signature_b64":"yfssTWL0Wfs/nXfZEUpsFbayjJl0lgWfoq/3AYGAWGx/NutShlHSc2HIhO21/QlbzKkZ8wqKwLQ9V0WyTYfrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f25e87f5ddf59fba97a5c0b1d5564ff0dfedf5f2f9c65adf8a12cacc7867ff5","last_reissued_at":"2026-05-18T01:30:00.603551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:00.603551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Solution to the Non-Domination Level Update Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Samrat Mondal, Sriparna Saha, Sumit Mishra","submitted_at":"2015-10-16T06:53:19Z","abstract_excerpt":"Non-domination level update problem is to sort the non-dominated fronts after insertion or deletion of a solution. Generally the solution to this problem requires to perform the complete non-dominated sorting which is too expensive in terms of number of comparisons. Recently an Efficient Non-domination Level Update (ENLU) approach is proposed which does not perform the complete sorting. For this purpose, in this paper a space efficient version of ENLU approach is proposed without compromising the number of comparisons. However this approach does not work satisfactorily in all the cases. So we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04796","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":"1510.04796","created_at":"2026-05-18T01:30:00.603689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04796v1","created_at":"2026-05-18T01:30:00.603689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04796","created_at":"2026-05-18T01:30:00.603689+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4S6Q72535M7","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4S6Q72535M7XKL2","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4S6Q725","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74","json":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74.json","graph_json":"https://pith.science/api/pith-number/P4S6Q72535M7XKL2LQFR2VLE74/graph.json","events_json":"https://pith.science/api/pith-number/P4S6Q72535M7XKL2LQFR2VLE74/events.json","paper":"https://pith.science/paper/P4S6Q725"},"agent_actions":{"view_html":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74","download_json":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74.json","view_paper":"https://pith.science/paper/P4S6Q725","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04796&json=true","fetch_graph":"https://pith.science/api/pith-number/P4S6Q72535M7XKL2LQFR2VLE74/graph.json","fetch_events":"https://pith.science/api/pith-number/P4S6Q72535M7XKL2LQFR2VLE74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74/action/storage_attestation","attest_author":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74/action/author_attestation","sign_citation":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74/action/citation_signature","submit_replication":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74/action/replication_record"}},"created_at":"2026-05-18T01:30:00.603689+00:00","updated_at":"2026-05-18T01:30:00.603689+00:00"}