{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:I7W6KAY4NLHBK4HUT6AKP2C2PV","short_pith_number":"pith:I7W6KAY4","canonical_record":{"source":{"id":"1210.7684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-29T15:03:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"97d0de0b4524a7609b8657b9aad296f36d396f2d4359acb7ff7d6fa083357d65","abstract_canon_sha256":"be2b61d52712bc6fc29e5086ee9dbd7d5940243c360b866e073d31b3568b80af"},"schema_version":"1.0"},"canonical_sha256":"47ede5031c6ace1570f49f80a7e85a7d790f74e8d5d032de5d85c67b9a823964","source":{"kind":"arxiv","id":"1210.7684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7684","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7684v1","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7684","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"I7W6KAY4NLHB","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"I7W6KAY4NLHBK4HU","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"I7W6KAY4","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:I7W6KAY4NLHBK4HUT6AKP2C2PV","target":"record","payload":{"canonical_record":{"source":{"id":"1210.7684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-29T15:03:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"97d0de0b4524a7609b8657b9aad296f36d396f2d4359acb7ff7d6fa083357d65","abstract_canon_sha256":"be2b61d52712bc6fc29e5086ee9dbd7d5940243c360b866e073d31b3568b80af"},"schema_version":"1.0"},"canonical_sha256":"47ede5031c6ace1570f49f80a7e85a7d790f74e8d5d032de5d85c67b9a823964","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:09.091511Z","signature_b64":"M7d6P8DjQe+QEfYNbRYFGB0u4Z0DNEkqzyO0+QsQJ3t9oD947WKpkRSqs9UWQKASq44/HNdN4pjtQfg+Tq22Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47ede5031c6ace1570f49f80a7e85a7d790f74e8d5d032de5d85c67b9a823964","last_reissued_at":"2026-05-18T03:42:09.090673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:09.090673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.7684","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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTRn7/yQWed7j7EiNEkEKAn2Av0CMub5h7BcQHx21T/zyIKhIBvT5i2ELYyNPMJ32COJ8NoP9FhHwl03wthWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:42:56.349421Z"},"content_sha256":"3cc7a1f713b5ab4a9b4d6b1b55fe5df79658638be7eca4522935982118cf9c24","schema_version":"1.0","event_id":"sha256:3cc7a1f713b5ab4a9b4d6b1b55fe5df79658638be7eca4522935982118cf9c24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:I7W6KAY4NLHBK4HUT6AKP2C2PV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Babak Farzad, Majid Karimi","submitted_at":"2012-10-29T15:03:03Z","abstract_excerpt":"Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H^2. Determining if a given graph G is the square of some graph is not easy in general. Motwani and Sudan proved that it is NP-complete to determine if a given graph G is the square of some graph. The graph introduced in their reduction is a graph that contains many triangles and is relatively dense. Farzad et al. proved the NP-completeness for finding a square root for girth 4 while they gave a polynomial time algorithm for comput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7684","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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AEPtphGwtdA0dgJjYeYrIiffL2TRl/qX2LrqAXUGyTZP0m3UNN4sar+KwftSplLrhCmeGrqH4IodESFcLU5MBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:42:56.349762Z"},"content_sha256":"658e886b82b10b7bcee06893b314f4222d59bc350fbca8daae9c27984fc5356f","schema_version":"1.0","event_id":"sha256:658e886b82b10b7bcee06893b314f4222d59bc350fbca8daae9c27984fc5356f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV/bundle.json","state_url":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV/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-06-03T12:42:56Z","links":{"resolver":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV","bundle":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV/bundle.json","state":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:I7W6KAY4NLHBK4HUT6AKP2C2PV","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":"be2b61d52712bc6fc29e5086ee9dbd7d5940243c360b866e073d31b3568b80af","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-29T15:03:03Z","title_canon_sha256":"97d0de0b4524a7609b8657b9aad296f36d396f2d4359acb7ff7d6fa083357d65"},"schema_version":"1.0","source":{"id":"1210.7684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7684","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7684v1","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7684","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"I7W6KAY4NLHB","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"I7W6KAY4NLHBK4HU","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"I7W6KAY4","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:658e886b82b10b7bcee06893b314f4222d59bc350fbca8daae9c27984fc5356f","target":"graph","created_at":"2026-05-18T03:42:09Z","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":"Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H^2. Determining if a given graph G is the square of some graph is not easy in general. Motwani and Sudan proved that it is NP-complete to determine if a given graph G is the square of some graph. The graph introduced in their reduction is a graph that contains many triangles and is relatively dense. Farzad et al. proved the NP-completeness for finding a square root for girth 4 while they gave a polynomial time algorithm for comput","authors_text":"Babak Farzad, Majid Karimi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-29T15:03:03Z","title":"Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7684","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:3cc7a1f713b5ab4a9b4d6b1b55fe5df79658638be7eca4522935982118cf9c24","target":"record","created_at":"2026-05-18T03:42:09Z","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":"be2b61d52712bc6fc29e5086ee9dbd7d5940243c360b866e073d31b3568b80af","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-29T15:03:03Z","title_canon_sha256":"97d0de0b4524a7609b8657b9aad296f36d396f2d4359acb7ff7d6fa083357d65"},"schema_version":"1.0","source":{"id":"1210.7684","kind":"arxiv","version":1}},"canonical_sha256":"47ede5031c6ace1570f49f80a7e85a7d790f74e8d5d032de5d85c67b9a823964","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47ede5031c6ace1570f49f80a7e85a7d790f74e8d5d032de5d85c67b9a823964","first_computed_at":"2026-05-18T03:42:09.090673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:09.090673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M7d6P8DjQe+QEfYNbRYFGB0u4Z0DNEkqzyO0+QsQJ3t9oD947WKpkRSqs9UWQKASq44/HNdN4pjtQfg+Tq22Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:09.091511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cc7a1f713b5ab4a9b4d6b1b55fe5df79658638be7eca4522935982118cf9c24","sha256:658e886b82b10b7bcee06893b314f4222d59bc350fbca8daae9c27984fc5356f"],"state_sha256":"5a2855ebed55fcc00a2bcdb301b3aab55cbabee89692133bc2a10b9e5fdec706"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUUe8SVA1AWIdnqVjwCWXn0NYh7Wb18lv3OQzTdmxKP84HY7hnLOD3N992CGsp1eHurz3Qg6upgER2XKttUXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:42:56.351646Z","bundle_sha256":"36131b57d3111cd9d00e5154667ca027a9e79b5af2a407f95146f8e12d21ca46"}}