{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Z5BDZJB4EDJQXIRRVXXDGXQA3G","short_pith_number":"pith:Z5BDZJB4","canonical_record":{"source":{"id":"1310.5469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-21T08:57:19Z","cross_cats_sorted":[],"title_canon_sha256":"94bfc4ca78a3a885f2c16412218b23dd180f26ac3d615815f22c13bb786803da","abstract_canon_sha256":"bc1cf1f9fa9d51fb4c135eaefc1897a12afa43df3c7cca11844a86022001b668"},"schema_version":"1.0"},"canonical_sha256":"cf423ca43c20d30ba231adee335e00d99b185f4695231c1c470ab5a526617cba","source":{"kind":"arxiv","id":"1310.5469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5469","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5469v1","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5469","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"Z5BDZJB4EDJQ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z5BDZJB4EDJQXIRR","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z5BDZJB4","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Z5BDZJB4EDJQXIRRVXXDGXQA3G","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-21T08:57:19Z","cross_cats_sorted":[],"title_canon_sha256":"94bfc4ca78a3a885f2c16412218b23dd180f26ac3d615815f22c13bb786803da","abstract_canon_sha256":"bc1cf1f9fa9d51fb4c135eaefc1897a12afa43df3c7cca11844a86022001b668"},"schema_version":"1.0"},"canonical_sha256":"cf423ca43c20d30ba231adee335e00d99b185f4695231c1c470ab5a526617cba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:35.544128Z","signature_b64":"0VOHv9bS3oBaoPhgJCVy+b94nBvamlgYE4CbrC1xSr4MUpvS9ltgGPuo6hwfbNxjytRmhIglf8SIl3v9ypZjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf423ca43c20d30ba231adee335e00d99b185f4695231c1c470ab5a526617cba","last_reissued_at":"2026-05-18T03:09:35.543313Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:35.543313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5469","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-18T03:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5IGoj0extR8n4QK/zxOrdkOcBQpJaydB390QHtwKDzebRVN6jMxQaObGGgbuNCmupbvORe0mbbfxSWBIpzaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:37:10.635410Z"},"content_sha256":"42c948c4699feb8ebe7bb89426f1a6530f1a1df9080b4666ab0aaf9000d57c73","schema_version":"1.0","event_id":"sha256:42c948c4699feb8ebe7bb89426f1a6530f1a1df9080b4666ab0aaf9000d57c73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Z5BDZJB4EDJQXIRRVXXDGXQA3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Finding Square Roots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dani\\\"el Paulusma, Dieter Kratsch, Jean-Fran\\c{c}ois Couturier, Manfred Cochefert, Petr A. Golovach","submitted_at":"2013-10-21T08:57:19Z","abstract_excerpt":"We show that the following two problems are fixed-parameter tractable with parameter k: testing whether a connected n-vertex graph with m edges has a square root with at most n-1+k edges and testing whether such a graph has a square root with at least m-k edges. Our first result implies that squares of graphs obtained from trees by adding at most k edges can be recognized in polynomial time for every fixed k>=0; previously this result was known only for k=0. Our second result is equivalent to stating that deciding whether a graph can be modified into a square root of itself by at most k edge d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5469","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-18T03:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZJ915Y72KweCBjqVV+o9UQnNir+kDZCa/kUBhLAWUiPtyZBmhi8HJ7rxooR6E4utahYKCoGN+A5eDEavY4ZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:37:10.636104Z"},"content_sha256":"84aa902d3a67bd6902159f38a5bd8ee3210513bc1d2cc5520ef10ddccbe5aef6","schema_version":"1.0","event_id":"sha256:84aa902d3a67bd6902159f38a5bd8ee3210513bc1d2cc5520ef10ddccbe5aef6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z5BDZJB4EDJQXIRRVXXDGXQA3G/bundle.json","state_url":"https://pith.science/pith/Z5BDZJB4EDJQXIRRVXXDGXQA3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z5BDZJB4EDJQXIRRVXXDGXQA3G/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-31T10:37:10Z","links":{"resolver":"https://pith.science/pith/Z5BDZJB4EDJQXIRRVXXDGXQA3G","bundle":"https://pith.science/pith/Z5BDZJB4EDJQXIRRVXXDGXQA3G/bundle.json","state":"https://pith.science/pith/Z5BDZJB4EDJQXIRRVXXDGXQA3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z5BDZJB4EDJQXIRRVXXDGXQA3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Z5BDZJB4EDJQXIRRVXXDGXQA3G","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":"bc1cf1f9fa9d51fb4c135eaefc1897a12afa43df3c7cca11844a86022001b668","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-21T08:57:19Z","title_canon_sha256":"94bfc4ca78a3a885f2c16412218b23dd180f26ac3d615815f22c13bb786803da"},"schema_version":"1.0","source":{"id":"1310.5469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5469","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5469v1","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5469","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"Z5BDZJB4EDJQ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z5BDZJB4EDJQXIRR","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z5BDZJB4","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:84aa902d3a67bd6902159f38a5bd8ee3210513bc1d2cc5520ef10ddccbe5aef6","target":"graph","created_at":"2026-05-18T03:09:35Z","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":"We show that the following two problems are fixed-parameter tractable with parameter k: testing whether a connected n-vertex graph with m edges has a square root with at most n-1+k edges and testing whether such a graph has a square root with at least m-k edges. Our first result implies that squares of graphs obtained from trees by adding at most k edges can be recognized in polynomial time for every fixed k>=0; previously this result was known only for k=0. Our second result is equivalent to stating that deciding whether a graph can be modified into a square root of itself by at most k edge d","authors_text":"Dani\\\"el Paulusma, Dieter Kratsch, Jean-Fran\\c{c}ois Couturier, Manfred Cochefert, Petr A. Golovach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-21T08:57:19Z","title":"Parameterized Algorithms for Finding Square Roots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5469","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:42c948c4699feb8ebe7bb89426f1a6530f1a1df9080b4666ab0aaf9000d57c73","target":"record","created_at":"2026-05-18T03:09:35Z","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":"bc1cf1f9fa9d51fb4c135eaefc1897a12afa43df3c7cca11844a86022001b668","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-21T08:57:19Z","title_canon_sha256":"94bfc4ca78a3a885f2c16412218b23dd180f26ac3d615815f22c13bb786803da"},"schema_version":"1.0","source":{"id":"1310.5469","kind":"arxiv","version":1}},"canonical_sha256":"cf423ca43c20d30ba231adee335e00d99b185f4695231c1c470ab5a526617cba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf423ca43c20d30ba231adee335e00d99b185f4695231c1c470ab5a526617cba","first_computed_at":"2026-05-18T03:09:35.543313Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:35.543313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0VOHv9bS3oBaoPhgJCVy+b94nBvamlgYE4CbrC1xSr4MUpvS9ltgGPuo6hwfbNxjytRmhIglf8SIl3v9ypZjCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:35.544128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42c948c4699feb8ebe7bb89426f1a6530f1a1df9080b4666ab0aaf9000d57c73","sha256:84aa902d3a67bd6902159f38a5bd8ee3210513bc1d2cc5520ef10ddccbe5aef6"],"state_sha256":"10c4c7513a376f9b580b0f72a23c6a61f2edbf3641a652e1173a5a1c237f7fd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IYTfi4PnnlDWXuQT8WTLsWpIS7fQceiViM12xIpAu7ZdsYaxbINNCfL6VC3iK58QHyOpzX1vGoIfVWh/N+0EBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:37:10.641239Z","bundle_sha256":"d9a6343bcc5a92b0e46aceccc6db16124c7ccf877a3b158cd419f95df49875af"}}