{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TWGTTIBE3XS6WXJPUOHTAN7EKD","short_pith_number":"pith:TWGTTIBE","canonical_record":{"source":{"id":"1703.05102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-15T12:06:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0fe88c310926d09c2b5f14a299f528b7e5daedba1da264114f14f8a97810a637","abstract_canon_sha256":"b6c49916fffc19b5878a140d1302b3aa93940812298cc565ea5629d55306fa00"},"schema_version":"1.0"},"canonical_sha256":"9d8d39a024dde5eb5d2fa38f3037e450da902458a045d400593c9805acab0347","source":{"kind":"arxiv","id":"1703.05102","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05102","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05102v2","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05102","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"TWGTTIBE3XS6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TWGTTIBE3XS6WXJP","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TWGTTIBE","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TWGTTIBE3XS6WXJPUOHTAN7EKD","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-15T12:06:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0fe88c310926d09c2b5f14a299f528b7e5daedba1da264114f14f8a97810a637","abstract_canon_sha256":"b6c49916fffc19b5878a140d1302b3aa93940812298cc565ea5629d55306fa00"},"schema_version":"1.0"},"canonical_sha256":"9d8d39a024dde5eb5d2fa38f3037e450da902458a045d400593c9805acab0347","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:57.095917Z","signature_b64":"8ml9xW/OcOrIpS7X7fG/quZ8XXBWYykHx9QHigZVpOoFRIyhqEhrGewPloSfCeJ+etoH3McKgSscoSge45G2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d8d39a024dde5eb5d2fa38f3037e450da902458a045d400593c9805acab0347","last_reissued_at":"2026-05-18T00:03:57.095211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:57.095211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05102","source_version":2,"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:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/9q10eksFy2vyX/VMurB7caPDvMIw/ZfKvdCik/IRaiG9rFw+5nJMb0QEIUDJgoVQ/ssD19PUoKyCvcGXMfSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:44:23.973277Z"},"content_sha256":"0f9bf691f3f5024539f2451edd811d7a7e982c9eb5fdaf8c8ada8f22e9c7c783","schema_version":"1.0","event_id":"sha256:0f9bf691f3f5024539f2451edd811d7a7e982c9eb5fdaf8c8ada8f22e9c7c783"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TWGTTIBE3XS6WXJPUOHTAN7EKD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Dieter Kratsch, Paloma T. Lima, Petr A. Golovach, Pinar Heggernes","submitted_at":"2017-03-15T12:06:53Z","abstract_excerpt":"Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial effort has been dedicated to deciding whether a given graph has a square root that belongs to a particular graph class. There are both polynomial-time solvable and NP-complete cases, depending on the graph class. We contribute with new results in this direction. Given an arbitrary input graph G, we give polynomial-time algorithms to decide whether G has an outerp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05102","kind":"arxiv","version":2},"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:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Zza3lyhStqWsvfczcNI8os7o11rC76QwdJXacrD4HnoOvvcx6cVn9VsGF8HiNoyEa7zX0VTODsiU5E2jFy7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:44:23.973957Z"},"content_sha256":"e0a1eb87ea290338655f1e73dff5618799e7617db4e8ed17b48fd5125e004161","schema_version":"1.0","event_id":"sha256:e0a1eb87ea290338655f1e73dff5618799e7617db4e8ed17b48fd5125e004161"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD/bundle.json","state_url":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD/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-25T23:44:23Z","links":{"resolver":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD","bundle":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD/bundle.json","state":"https://pith.science/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWGTTIBE3XS6WXJPUOHTAN7EKD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TWGTTIBE3XS6WXJPUOHTAN7EKD","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":"b6c49916fffc19b5878a140d1302b3aa93940812298cc565ea5629d55306fa00","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-15T12:06:53Z","title_canon_sha256":"0fe88c310926d09c2b5f14a299f528b7e5daedba1da264114f14f8a97810a637"},"schema_version":"1.0","source":{"id":"1703.05102","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05102","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05102v2","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05102","created_at":"2026-05-18T00:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"TWGTTIBE3XS6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TWGTTIBE3XS6WXJP","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TWGTTIBE","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:e0a1eb87ea290338655f1e73dff5618799e7617db4e8ed17b48fd5125e004161","target":"graph","created_at":"2026-05-18T00:03:57Z","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":"Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial effort has been dedicated to deciding whether a given graph has a square root that belongs to a particular graph class. There are both polynomial-time solvable and NP-complete cases, depending on the graph class. We contribute with new results in this direction. Given an arbitrary input graph G, we give polynomial-time algorithms to decide whether G has an outerp","authors_text":"Daniel Paulusma, Dieter Kratsch, Paloma T. Lima, Petr A. Golovach, Pinar Heggernes","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-15T12:06:53Z","title":"Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05102","kind":"arxiv","version":2},"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:0f9bf691f3f5024539f2451edd811d7a7e982c9eb5fdaf8c8ada8f22e9c7c783","target":"record","created_at":"2026-05-18T00:03:57Z","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":"b6c49916fffc19b5878a140d1302b3aa93940812298cc565ea5629d55306fa00","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-15T12:06:53Z","title_canon_sha256":"0fe88c310926d09c2b5f14a299f528b7e5daedba1da264114f14f8a97810a637"},"schema_version":"1.0","source":{"id":"1703.05102","kind":"arxiv","version":2}},"canonical_sha256":"9d8d39a024dde5eb5d2fa38f3037e450da902458a045d400593c9805acab0347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d8d39a024dde5eb5d2fa38f3037e450da902458a045d400593c9805acab0347","first_computed_at":"2026-05-18T00:03:57.095211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:57.095211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ml9xW/OcOrIpS7X7fG/quZ8XXBWYykHx9QHigZVpOoFRIyhqEhrGewPloSfCeJ+etoH3McKgSscoSge45G2Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:57.095917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05102","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f9bf691f3f5024539f2451edd811d7a7e982c9eb5fdaf8c8ada8f22e9c7c783","sha256:e0a1eb87ea290338655f1e73dff5618799e7617db4e8ed17b48fd5125e004161"],"state_sha256":"67745e9d6e98b4d4a6625ae97af7deea078880298f77ce93eb2f131a5c9eeab3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4D+a4xwKHgAVXNjsxc4BPSWKvkUJAwE1bqm48lc4/CCNET4bYam+Vq4DEz7WyjpgLZefZKACw5mTg42VozYpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:44:23.977385Z","bundle_sha256":"6e1b10e1a36fccf3e324cdb28d46591ecf34af2d6f0e5af5484702d0d65b892c"}}