{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IBWWZYLK2IZARDETZDCVSQOBAT","short_pith_number":"pith:IBWWZYLK","canonical_record":{"source":{"id":"1608.06142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-22T12:18:30Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"be497966874b87a7a183ed7fe7bcbc7ca04a71148123bdaa11921a5bb4c96d0f","abstract_canon_sha256":"d10e5f55f09515a5675d46f44544a75c51d5457fe1553134863e5e68c09c21f7"},"schema_version":"1.0"},"canonical_sha256":"406d6ce16ad232088c93c8c55941c104c0a472cb23ef180d3767305863b64fc1","source":{"kind":"arxiv","id":"1608.06142","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IBWWZYLK2IZARDETZDCVSQOBAT","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-22T12:18:30Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"be497966874b87a7a183ed7fe7bcbc7ca04a71148123bdaa11921a5bb4c96d0f","abstract_canon_sha256":"d10e5f55f09515a5675d46f44544a75c51d5457fe1553134863e5e68c09c21f7"},"schema_version":"1.0"},"canonical_sha256":"406d6ce16ad232088c93c8c55941c104c0a472cb23ef180d3767305863b64fc1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:50.432359Z","signature_b64":"1IMJ3hVCuDuRxDYa/tGhAKxdPMKZVzTHbiyuVHj15t3R7UJh54+XRAPUlxBWB6z5EeG3bhdKQoKjksG5QU5SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"406d6ce16ad232088c93c8c55941c104c0a472cb23ef180d3767305863b64fc1","last_reissued_at":"2026-05-18T01:07:50.431826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:50.431826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06142","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-18T01:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"beFIqDOGn2J3kjS/YjOlRbcy1MxOYYUthI28Su1JPfoEfk72djz/BeR+XEx2IbS7iVZzlplS4qPIJpkOsCe6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:01:24.113390Z"},"content_sha256":"543e5e2ffd5989acbd1444c2205469fd5a5f99bee887753e4a85e8c242134efb","schema_version":"1.0","event_id":"sha256:543e5e2ffd5989acbd1444c2205469fd5a5f99bee887753e4a85e8c242134efb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IBWWZYLK2IZARDETZDCVSQOBAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Squares of Low Maximum Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Anthony Stewart, Dani\\\"el Paulusma, Dieter Kratsch, Jean-Fran\\c{c}ois Couturier, Manfred Cochefert, Petr A. Golovach","submitted_at":"2016-08-22T12:18:30Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06142","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-18T01:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11by0cVNzYAIIkLj3SzhPUJk6ku3TlQxDMtx4koFqCSWuWWfeAd8sI8UkU5Cm9pG+fOc71gj8Q5X2bX6F2aoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:01:24.114043Z"},"content_sha256":"aeb440d8774e13e66a2c5c6ae429f1ab8f697bda44f325b2ad4c1233335e8cc7","schema_version":"1.0","event_id":"sha256:aeb440d8774e13e66a2c5c6ae429f1ab8f697bda44f325b2ad4c1233335e8cc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBWWZYLK2IZARDETZDCVSQOBAT/bundle.json","state_url":"https://pith.science/pith/IBWWZYLK2IZARDETZDCVSQOBAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBWWZYLK2IZARDETZDCVSQOBAT/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-25T14:01:24Z","links":{"resolver":"https://pith.science/pith/IBWWZYLK2IZARDETZDCVSQOBAT","bundle":"https://pith.science/pith/IBWWZYLK2IZARDETZDCVSQOBAT/bundle.json","state":"https://pith.science/pith/IBWWZYLK2IZARDETZDCVSQOBAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBWWZYLK2IZARDETZDCVSQOBAT/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R/WcXa1rgsWyYftnN4C9DApefU5cxTmsTTSe2Yrm6gZ2jFtAOOZ3zOhE10TeyjZrKF/sEkM6kEy3VQZd8OYZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:01:24.117753Z","bundle_sha256":"73bba9e66affbe53ff15b2a3b19b1ce2f8bbb1a27b494ecbdd9557d1b1ff181c"}}