{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J2CDU37SFSTCUVNZXNWT4JLJ6K","short_pith_number":"pith:J2CDU37S","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"},"canonical_sha256":"4e843a6ff22ca62a55b9bb6d3e2569f2a175c713c54f613b6b9c4b1bca324b50","source":{"kind":"arxiv","id":"1608.06136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06136","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06136v1","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06136","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"J2CDU37SFSTC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2CDU37SFSTCUVNZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2CDU37S","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J2CDU37SFSTCUVNZXNWT4JLJ6K","target":"record","payload":{"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"},"canonical_sha256":"4e843a6ff22ca62a55b9bb6d3e2569f2a175c713c54f613b6b9c4b1bca324b50","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"},"source_kind":"arxiv","source_id":"1608.06136","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:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GH8P5I7nCarMpPYWEv77CMc3JZ8F+NfHCgzUDXYyMNiT3aaBGBvWN3/mRrSqX14uEqTZH26zwv+h3Sb8pialAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:23:09.365817Z"},"content_sha256":"19f2e6356e31147e304538762ca6a05daa847ab5e83e2127ba7168db173e6aae","schema_version":"1.0","event_id":"sha256:19f2e6356e31147e304538762ca6a05daa847ab5e83e2127ba7168db173e6aae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J2CDU37SFSTCUVNZXNWT4JLJ6K","target":"graph","payload":{"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"},"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:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cGeYhZf1P3gUmeJHBYePyd1K67fwTdR5DCF0qigDvuW7o6a3ruDmyF8SP5ifdngt5L53sb6czKegYKQG3PrcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:23:09.366515Z"},"content_sha256":"865c72fb049449bfcfc249c6ce0a2408001b6be1fc98cf23bc1981c105b6a3e3","schema_version":"1.0","event_id":"sha256:865c72fb049449bfcfc249c6ce0a2408001b6be1fc98cf23bc1981c105b6a3e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K/bundle.json","state_url":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K/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-25T22:23:09Z","links":{"resolver":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K","bundle":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K/bundle.json","state":"https://pith.science/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2CDU37SFSTCUVNZXNWT4JLJ6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J2CDU37SFSTCUVNZXNWT4JLJ6K","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":"cb20d183a5d94a6b237cfff3876eba568d7542da3b8c7efa1588a6f00eb9e13c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-22T12:03:53Z","title_canon_sha256":"ff6de88eb72ac6ecf5a145d577ceefcb0bd73adc55fedb875dfaa8599f3fb925"},"schema_version":"1.0","source":{"id":"1608.06136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06136","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06136v1","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06136","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"J2CDU37SFSTC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2CDU37SFSTCUVNZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2CDU37S","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:865c72fb049449bfcfc249c6ce0a2408001b6be1fc98cf23bc1981c105b6a3e3","target":"graph","created_at":"2026-05-18T01:08:22Z","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":"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","authors_text":"Anthony Stewart, Dani\\\"el Paulusma, Dieter Kratsch, Petr A. Golovach","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-22T12:03:53Z","title":"A Linear Kernel for Finding Square Roots of Almost Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06136","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:19f2e6356e31147e304538762ca6a05daa847ab5e83e2127ba7168db173e6aae","target":"record","created_at":"2026-05-18T01:08:22Z","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":"cb20d183a5d94a6b237cfff3876eba568d7542da3b8c7efa1588a6f00eb9e13c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-22T12:03:53Z","title_canon_sha256":"ff6de88eb72ac6ecf5a145d577ceefcb0bd73adc55fedb875dfaa8599f3fb925"},"schema_version":"1.0","source":{"id":"1608.06136","kind":"arxiv","version":1}},"canonical_sha256":"4e843a6ff22ca62a55b9bb6d3e2569f2a175c713c54f613b6b9c4b1bca324b50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e843a6ff22ca62a55b9bb6d3e2569f2a175c713c54f613b6b9c4b1bca324b50","first_computed_at":"2026-05-18T01:08:22.160087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:22.160087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hVRs9fEwZYxf6JOiqVH4BLkJDIyfHguIfphut8G5HQy7J2MK1kkN4IKxboi6+zsB9xMBJcvSlbzv1ff8OCCQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:22.160629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19f2e6356e31147e304538762ca6a05daa847ab5e83e2127ba7168db173e6aae","sha256:865c72fb049449bfcfc249c6ce0a2408001b6be1fc98cf23bc1981c105b6a3e3"],"state_sha256":"46eb42dd96d6484acb92182ab4f50d30ef10fd3bbbb37efc83227687d6e8f307"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KLPODwZGCw62sjOt9MT+XTesp5YYTR2F0p8CqQhJxNPE0OkhL0FVO3OOxb6kGDJaQX7DTc/+QogKsd043iSpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:23:09.370059Z","bundle_sha256":"2e146f69aeb793ec2b5096a81e3bf750d37ad91929ecd484c36748cd075353fa"}}