{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J2CDU37SFSTCUVNZXNWT4JLJ6K","short_pith_number":"pith:J2CDU37S","schema_version":"1.0","canonical_sha256":"4e843a6ff22ca62a55b9bb6d3e2569f2a175c713c54f613b6b9c4b1bca324b50","source":{"kind":"arxiv","id":"1608.06136","version":1},"attestation_state":"computed","paper":{"title":"A Linear Kernel for Finding Square Roots of Almost Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Anthony Stewart, Dani\\\"el Paulusma, Dieter Kratsch, Petr A. Golovach","submitted_at":"2016-08-22T12:03:53Z","abstract_excerpt":"A graph H is a square root of a graph G if G can be obtained from H by the addition of edges between any two vertices in H that are of distance 2 from each other. The Square Root problem is that of deciding whether a given graph admits a square root. We consider this problem for planar graphs in the context of the \"distance from triviality\" framework. For an integer k, a planar+kv graph (or k-apex graph) is a graph that can be made planar by the removal of at most k vertices. We prove that a generalization of Square Root, in which some edges are prescribed to be either in or out of any solutio"},"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":"1608.06136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-22T12:03:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ff6de88eb72ac6ecf5a145d577ceefcb0bd73adc55fedb875dfaa8599f3fb925","abstract_canon_sha256":"cb20d183a5d94a6b237cfff3876eba568d7542da3b8c7efa1588a6f00eb9e13c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:22.160629Z","signature_b64":"hVRs9fEwZYxf6JOiqVH4BLkJDIyfHguIfphut8G5HQy7J2MK1kkN4IKxboi6+zsB9xMBJcvSlbzv1ff8OCCQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e843a6ff22ca62a55b9bb6d3e2569f2a175c713c54f613b6b9c4b1bca324b50","last_reissued_at":"2026-05-18T01:08:22.160087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:22.160087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linear Kernel for Finding Square Roots of Almost Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Anthony Stewart, Dani\\\"el Paulusma, Dieter Kratsch, Petr A. Golovach","submitted_at":"2016-08-22T12:03:53Z","abstract_excerpt":"A graph H is a square root of a graph G if G can be obtained from H by the addition of edges between any two vertices in H that are of distance 2 from each other. The Square Root problem is that of deciding whether a given graph admits a square root. We consider this problem for planar graphs in the context of the \"distance from triviality\" framework. For an integer k, a planar+kv graph (or k-apex graph) is a graph that can be made planar by the removal of at most k vertices. We prove that a generalization of Square Root, in which some edges are prescribed to be either in or out of any solutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06136","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":"1608.06136","created_at":"2026-05-18T01:08:22.160176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06136v1","created_at":"2026-05-18T01:08:22.160176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06136","created_at":"2026-05-18T01:08:22.160176+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2CDU37SFSTC","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2CDU37SFSTCUVNZ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2CDU37S","created_at":"2026-05-18T12:30:22.444734+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/J2CDU37SFSTCUVNZXNWT4JLJ6K","json":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K.json","graph_json":"https://pith.science/api/pith-number/J2CDU37SFSTCUVNZXNWT4JLJ6K/graph.json","events_json":"https://pith.science/api/pith-number/J2CDU37SFSTCUVNZXNWT4JLJ6K/events.json","paper":"https://pith.science/paper/J2CDU37S"},"agent_actions":{"view_html":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K","download_json":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K.json","view_paper":"https://pith.science/paper/J2CDU37S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06136&json=true","fetch_graph":"https://pith.science/api/pith-number/J2CDU37SFSTCUVNZXNWT4JLJ6K/graph.json","fetch_events":"https://pith.science/api/pith-number/J2CDU37SFSTCUVNZXNWT4JLJ6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K/action/storage_attestation","attest_author":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K/action/author_attestation","sign_citation":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K/action/citation_signature","submit_replication":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K/action/replication_record"}},"created_at":"2026-05-18T01:08:22.160176+00:00","updated_at":"2026-05-18T01:08:22.160176+00:00"}