{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IBWWZYLK2IZARDETZDCVSQOBAT","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":"d10e5f55f09515a5675d46f44544a75c51d5457fe1553134863e5e68c09c21f7","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-22T12:18:30Z","title_canon_sha256":"be497966874b87a7a183ed7fe7bcbc7ca04a71148123bdaa11921a5bb4c96d0f"},"schema_version":"1.0","source":{"id":"1608.06142","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06142","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06142v2","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06142","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"IBWWZYLK2IZA","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IBWWZYLK2IZARDET","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IBWWZYLK","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:aeb440d8774e13e66a2c5c6ae429f1ab8f697bda44f325b2ad4c1233335e8cc7","target":"graph","created_at":"2026-05-18T01:07:50Z","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 adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. This problem is only known to be NP-complete for chordal graphs and polynomial-time solvable for non-trivial minor-closed graph classes and a very limited number of other graph classes. We prove that Square Root is O(n)-time solvable for graphs of maximum degree 5 and O(n^4)-time solvable for graphs of maximum degree at most 6.","authors_text":"Anthony Stewart, Dani\\\"el Paulusma, Dieter Kratsch, Jean-Fran\\c{c}ois Couturier, Manfred Cochefert, Petr A. Golovach","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-22T12:18:30Z","title":"Squares of Low Maximum Degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06142","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:543e5e2ffd5989acbd1444c2205469fd5a5f99bee887753e4a85e8c242134efb","target":"record","created_at":"2026-05-18T01:07:50Z","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":"d10e5f55f09515a5675d46f44544a75c51d5457fe1553134863e5e68c09c21f7","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-22T12:18:30Z","title_canon_sha256":"be497966874b87a7a183ed7fe7bcbc7ca04a71148123bdaa11921a5bb4c96d0f"},"schema_version":"1.0","source":{"id":"1608.06142","kind":"arxiv","version":2}},"canonical_sha256":"406d6ce16ad232088c93c8c55941c104c0a472cb23ef180d3767305863b64fc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"406d6ce16ad232088c93c8c55941c104c0a472cb23ef180d3767305863b64fc1","first_computed_at":"2026-05-18T01:07:50.431826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:50.431826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1IMJ3hVCuDuRxDYa/tGhAKxdPMKZVzTHbiyuVHj15t3R7UJh54+XRAPUlxBWB6z5EeG3bhdKQoKjksG5QU5SCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:50.432359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06142","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:543e5e2ffd5989acbd1444c2205469fd5a5f99bee887753e4a85e8c242134efb","sha256:aeb440d8774e13e66a2c5c6ae429f1ab8f697bda44f325b2ad4c1233335e8cc7"],"state_sha256":"0369613d37e21b48a72814a4d15c592f90b8c321fab0b347b8957b67fbf94104"}