{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:P4S6Q72535M7XKL2LQFR2VLE74","short_pith_number":"pith:P4S6Q725","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"},"canonical_sha256":"7f25e87f5ddf59fba97a5c0b1d5564ff0dfedf5f2f9c65adf8a12cacc7867ff5","source":{"kind":"arxiv","id":"1510.04796","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04796","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04796v1","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04796","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"P4S6Q72535M7","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P4S6Q72535M7XKL2","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P4S6Q725","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:P4S6Q72535M7XKL2LQFR2VLE74","target":"record","payload":{"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"},"canonical_sha256":"7f25e87f5ddf59fba97a5c0b1d5564ff0dfedf5f2f9c65adf8a12cacc7867ff5","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"},"source_kind":"arxiv","source_id":"1510.04796","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-18T01:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4NcU7oR1AN60lNL0L6ul7RJ8HTvH2cytlhxKYlB5bITRcCWij4KgeAB/aqtgu5evd4rS6GejGNr7WKn4fXVzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:29:28.243165Z"},"content_sha256":"be68ee11ecaebd2ded8269066d930a869c8c5a470e1ce7c25fbcb51af25c0433","schema_version":"1.0","event_id":"sha256:be68ee11ecaebd2ded8269066d930a869c8c5a470e1ce7c25fbcb51af25c0433"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:P4S6Q72535M7XKL2LQFR2VLE74","target":"graph","payload":{"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"},"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-18T01:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9qrctM4Cl7z9dTiw40UX7bzlhWT8SDiGaLDT+b2HpT4czSqFVSZTv2q1DO44lc4hN/QolzidOrpfwFwoXciKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:29:28.243837Z"},"content_sha256":"f64b6cb03807512ce35b92db6ab6f4823a2a7dc8c5ffe51d57528ea38fc17cfb","schema_version":"1.0","event_id":"sha256:f64b6cb03807512ce35b92db6ab6f4823a2a7dc8c5ffe51d57528ea38fc17cfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74/bundle.json","state_url":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4S6Q72535M7XKL2LQFR2VLE74/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-31T22:29:28Z","links":{"resolver":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74","bundle":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74/bundle.json","state":"https://pith.science/pith/P4S6Q72535M7XKL2LQFR2VLE74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4S6Q72535M7XKL2LQFR2VLE74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:P4S6Q72535M7XKL2LQFR2VLE74","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":"51dbdc38f68b863d3f32dcf03f2bd0ace1fb0f10946fb8484610300e78fd863e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-16T06:53:19Z","title_canon_sha256":"bf51199f10bd102e01308e52b838550ea532c6872c24965d643578e84766f1ad"},"schema_version":"1.0","source":{"id":"1510.04796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04796","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04796v1","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04796","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"P4S6Q72535M7","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P4S6Q72535M7XKL2","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P4S6Q725","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:f64b6cb03807512ce35b92db6ab6f4823a2a7dc8c5ffe51d57528ea38fc17cfb","target":"graph","created_at":"2026-05-18T01:30:00Z","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":"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 ","authors_text":"Samrat Mondal, Sriparna Saha, Sumit Mishra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-16T06:53:19Z","title":"Improved Solution to the Non-Domination Level Update Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04796","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:be68ee11ecaebd2ded8269066d930a869c8c5a470e1ce7c25fbcb51af25c0433","target":"record","created_at":"2026-05-18T01:30:00Z","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":"51dbdc38f68b863d3f32dcf03f2bd0ace1fb0f10946fb8484610300e78fd863e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-16T06:53:19Z","title_canon_sha256":"bf51199f10bd102e01308e52b838550ea532c6872c24965d643578e84766f1ad"},"schema_version":"1.0","source":{"id":"1510.04796","kind":"arxiv","version":1}},"canonical_sha256":"7f25e87f5ddf59fba97a5c0b1d5564ff0dfedf5f2f9c65adf8a12cacc7867ff5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f25e87f5ddf59fba97a5c0b1d5564ff0dfedf5f2f9c65adf8a12cacc7867ff5","first_computed_at":"2026-05-18T01:30:00.603551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:00.603551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yfssTWL0Wfs/nXfZEUpsFbayjJl0lgWfoq/3AYGAWGx/NutShlHSc2HIhO21/QlbzKkZ8wqKwLQ9V0WyTYfrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:00.604277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be68ee11ecaebd2ded8269066d930a869c8c5a470e1ce7c25fbcb51af25c0433","sha256:f64b6cb03807512ce35b92db6ab6f4823a2a7dc8c5ffe51d57528ea38fc17cfb"],"state_sha256":"b2732e9c467c3b2328c94cd4bf0016b9abaeb7389f0073a9a01324859e804a0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6bDpqgOgCLa8zfFOwXHuIS1eiJxdBVlQEMp/P3s8t3D09Pc5n2RwqhCT9XQAzegm/0XXvzc/4p/2tOjbPLBJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:29:28.247436Z","bundle_sha256":"62b8851aaeae6b68a787efdec11b5df41e337bc1209637c94005500e45589a3b"}}