{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DLPAS62TYD6J3UMBOCSFNXTZKB","short_pith_number":"pith:DLPAS62T","canonical_record":{"source":{"id":"1702.05710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-19T07:19:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bb4859939e70687fcb40b962ec7ae6609c71a3d6fa0b9af0a7c68137255918b7","abstract_canon_sha256":"b5e3519e77750a33d3547007eace703c55283834be88e0639b077c233e8d3c56"},"schema_version":"1.0"},"canonical_sha256":"1ade097b53c0fc9dd18170a456de79506305ea83aa640a91df5273b1402203d2","source":{"kind":"arxiv","id":"1702.05710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05710","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05710v1","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05710","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"DLPAS62TYD6J","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DLPAS62TYD6J3UMB","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DLPAS62T","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DLPAS62TYD6J3UMBOCSFNXTZKB","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-19T07:19:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bb4859939e70687fcb40b962ec7ae6609c71a3d6fa0b9af0a7c68137255918b7","abstract_canon_sha256":"b5e3519e77750a33d3547007eace703c55283834be88e0639b077c233e8d3c56"},"schema_version":"1.0"},"canonical_sha256":"1ade097b53c0fc9dd18170a456de79506305ea83aa640a91df5273b1402203d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:25.555456Z","signature_b64":"ZIIl4R5+xbF/a0GbpElTpN5LqFFE60om2nZpQL9V/OQ9E/0QI330Xz8tMYdgDbykSOXjwiDFLJfOkEsBRrr5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ade097b53c0fc9dd18170a456de79506305ea83aa640a91df5273b1402203d2","last_reissued_at":"2026-05-18T00:50:25.554650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:25.554650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05710","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:50:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwYfUN0ZkxQogdybedwP6CIFex9MuHhNETULKTh2FoYsY553slS4yRzo01ERXhc61qDF0f1RZXIEPHhW4Y4TAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:03:59.245087Z"},"content_sha256":"ca1bb037c0cb53d06d8f6ef95fccb6aeef2b549bacee48d4e8fa9986b57fad2b","schema_version":"1.0","event_id":"sha256:ca1bb037c0cb53d06d8f6ef95fccb6aeef2b549bacee48d4e8fa9986b57fad2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DLPAS62TYD6J3UMBOCSFNXTZKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Gur Saran, Kamal Srivastava, Pallavi Jain","submitted_at":"2017-02-19T07:19:52Z","abstract_excerpt":"Vertex Separation Minimization Problem (VSMP) consists of finding a layout of a graph G = (V,E) which minimizes the maximum vertex cut or separation of a layout. It is an NP-complete problem in general for which metaheuristic techniques can be applied to find near optimal solution. VSMP has applications in VLSI design, graph drawing and computer language compiler design. VSMP is polynomially solvable for grids, trees, permutation graphs and cographs. Construction heuristics play a very important role in the metaheuristic techniques as they are responsible for generating initial solutions which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05710","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:50:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l50s/v3LZqogowvip54ZmHH1w42fHMlwAizl5GSpcZmzTJokC0ViozULGoy81bbuHQbhuY9BKkjI1qbt56XQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:03:59.245455Z"},"content_sha256":"442e9e4d5ea2a68c660b683865878895cecc7f9dff0c9f88f5ee70b29988ac31","schema_version":"1.0","event_id":"sha256:442e9e4d5ea2a68c660b683865878895cecc7f9dff0c9f88f5ee70b29988ac31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLPAS62TYD6J3UMBOCSFNXTZKB/bundle.json","state_url":"https://pith.science/pith/DLPAS62TYD6J3UMBOCSFNXTZKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLPAS62TYD6J3UMBOCSFNXTZKB/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-28T21:03:59Z","links":{"resolver":"https://pith.science/pith/DLPAS62TYD6J3UMBOCSFNXTZKB","bundle":"https://pith.science/pith/DLPAS62TYD6J3UMBOCSFNXTZKB/bundle.json","state":"https://pith.science/pith/DLPAS62TYD6J3UMBOCSFNXTZKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLPAS62TYD6J3UMBOCSFNXTZKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DLPAS62TYD6J3UMBOCSFNXTZKB","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":"b5e3519e77750a33d3547007eace703c55283834be88e0639b077c233e8d3c56","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-19T07:19:52Z","title_canon_sha256":"bb4859939e70687fcb40b962ec7ae6609c71a3d6fa0b9af0a7c68137255918b7"},"schema_version":"1.0","source":{"id":"1702.05710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05710","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05710v1","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05710","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"DLPAS62TYD6J","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DLPAS62TYD6J3UMB","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DLPAS62T","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:442e9e4d5ea2a68c660b683865878895cecc7f9dff0c9f88f5ee70b29988ac31","target":"graph","created_at":"2026-05-18T00:50:25Z","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":"Vertex Separation Minimization Problem (VSMP) consists of finding a layout of a graph G = (V,E) which minimizes the maximum vertex cut or separation of a layout. It is an NP-complete problem in general for which metaheuristic techniques can be applied to find near optimal solution. VSMP has applications in VLSI design, graph drawing and computer language compiler design. VSMP is polynomially solvable for grids, trees, permutation graphs and cographs. Construction heuristics play a very important role in the metaheuristic techniques as they are responsible for generating initial solutions which","authors_text":"Gur Saran, Kamal Srivastava, Pallavi Jain","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-19T07:19:52Z","title":"Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05710","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:ca1bb037c0cb53d06d8f6ef95fccb6aeef2b549bacee48d4e8fa9986b57fad2b","target":"record","created_at":"2026-05-18T00:50:25Z","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":"b5e3519e77750a33d3547007eace703c55283834be88e0639b077c233e8d3c56","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-19T07:19:52Z","title_canon_sha256":"bb4859939e70687fcb40b962ec7ae6609c71a3d6fa0b9af0a7c68137255918b7"},"schema_version":"1.0","source":{"id":"1702.05710","kind":"arxiv","version":1}},"canonical_sha256":"1ade097b53c0fc9dd18170a456de79506305ea83aa640a91df5273b1402203d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ade097b53c0fc9dd18170a456de79506305ea83aa640a91df5273b1402203d2","first_computed_at":"2026-05-18T00:50:25.554650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:25.554650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZIIl4R5+xbF/a0GbpElTpN5LqFFE60om2nZpQL9V/OQ9E/0QI330Xz8tMYdgDbykSOXjwiDFLJfOkEsBRrr5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:25.555456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca1bb037c0cb53d06d8f6ef95fccb6aeef2b549bacee48d4e8fa9986b57fad2b","sha256:442e9e4d5ea2a68c660b683865878895cecc7f9dff0c9f88f5ee70b29988ac31"],"state_sha256":"8d84f78aff3a883560beb4a63e932da9267365b2d4bd2b448e4c05f2087befca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZzd5lQLsgOSHx4KAdKjuYySlAr4iDBchX+SWFl3tmXh27xD5FYse7LfTE3b6gFgEGA2cAnFZgY9JPkvYL3iCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T21:03:59.247373Z","bundle_sha256":"c52bddc236abfa6c9edef26d4405d934ca6259f7d8d2d648649f07f7bcfaf788"}}