{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EU6LX2ERFOGWIB3MVIESGWCXUI","short_pith_number":"pith:EU6LX2ER","schema_version":"1.0","canonical_sha256":"253cbbe8912b8d64076caa09235857a22e32f63ab9937b9584326c780baf27f9","source":{"kind":"arxiv","id":"1712.05711","version":1},"attestation_state":"computed","paper":{"title":"Results for the maximum weight planar subgraph problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Diane Castonguay, Elis\\^angela Silva Dias, Leslie Richard Foulds","submitted_at":"2017-12-15T15:25:05Z","abstract_excerpt":"The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, systems biology, sociology and finance. As the problem is known to be NP-hard, much research effort has been devoted over the years to attempt to improve a given approximate solution to the problem by using local moves applied to a planar embedding of the solution. It has long been established that any feasible solution to the problem, a maximal planar graph, can be transformed into any other (having the same vertex set)"},"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":"1712.05711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-15T15:25:05Z","cross_cats_sorted":[],"title_canon_sha256":"768875e3c973af2c6474bdadb8769398dcad027bf3932babaee785ab27fa2b51","abstract_canon_sha256":"7cbed7b7ad72721d19b0057624bd13972abce76a43be56acdd03bc7eb47b2d99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:55.852029Z","signature_b64":"CZ5YOyE1zjTp4KXBA1biV1fJpxCGhc3sPaSxyzhgVRgK3GSzPnA4gKC9n9aQkAEyvp3oK3dJTTxBTDursSfpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"253cbbe8912b8d64076caa09235857a22e32f63ab9937b9584326c780baf27f9","last_reissued_at":"2026-05-18T00:27:55.851589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:55.851589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Results for the maximum weight planar subgraph problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Diane Castonguay, Elis\\^angela Silva Dias, Leslie Richard Foulds","submitted_at":"2017-12-15T15:25:05Z","abstract_excerpt":"The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, systems biology, sociology and finance. As the problem is known to be NP-hard, much research effort has been devoted over the years to attempt to improve a given approximate solution to the problem by using local moves applied to a planar embedding of the solution. It has long been established that any feasible solution to the problem, a maximal planar graph, can be transformed into any other (having the same vertex set)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05711","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":"1712.05711","created_at":"2026-05-18T00:27:55.851661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05711v1","created_at":"2026-05-18T00:27:55.851661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05711","created_at":"2026-05-18T00:27:55.851661+00:00"},{"alias_kind":"pith_short_12","alias_value":"EU6LX2ERFOGW","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EU6LX2ERFOGWIB3M","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EU6LX2ER","created_at":"2026-05-18T12:31:12.930513+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/EU6LX2ERFOGWIB3MVIESGWCXUI","json":"https://pith.science/pith/EU6LX2ERFOGWIB3MVIESGWCXUI.json","graph_json":"https://pith.science/api/pith-number/EU6LX2ERFOGWIB3MVIESGWCXUI/graph.json","events_json":"https://pith.science/api/pith-number/EU6LX2ERFOGWIB3MVIESGWCXUI/events.json","paper":"https://pith.science/paper/EU6LX2ER"},"agent_actions":{"view_html":"https://pith.science/pith/EU6LX2ERFOGWIB3MVIESGWCXUI","download_json":"https://pith.science/pith/EU6LX2ERFOGWIB3MVIESGWCXUI.json","view_paper":"https://pith.science/paper/EU6LX2ER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05711&json=true","fetch_graph":"https://pith.science/api/pith-number/EU6LX2ERFOGWIB3MVIESGWCXUI/graph.json","fetch_events":"https://pith.science/api/pith-number/EU6LX2ERFOGWIB3MVIESGWCXUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EU6LX2ERFOGWIB3MVIESGWCXUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EU6LX2ERFOGWIB3MVIESGWCXUI/action/storage_attestation","attest_author":"https://pith.science/pith/EU6LX2ERFOGWIB3MVIESGWCXUI/action/author_attestation","sign_citation":"https://pith.science/pith/EU6LX2ERFOGWIB3MVIESGWCXUI/action/citation_signature","submit_replication":"https://pith.science/pith/EU6LX2ERFOGWIB3MVIESGWCXUI/action/replication_record"}},"created_at":"2026-05-18T00:27:55.851661+00:00","updated_at":"2026-05-18T00:27:55.851661+00:00"}