{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:I7W6KAY4NLHBK4HUT6AKP2C2PV","short_pith_number":"pith:I7W6KAY4","schema_version":"1.0","canonical_sha256":"47ede5031c6ace1570f49f80a7e85a7d790f74e8d5d032de5d85c67b9a823964","source":{"kind":"arxiv","id":"1210.7684","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.7684","created_at":"2026-05-18T03:42:09.090772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7684v1","created_at":"2026-05-18T03:42:09.090772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7684","created_at":"2026-05-18T03:42:09.090772+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7W6KAY4NLHB","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7W6KAY4NLHBK4HU","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7W6KAY4","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV","json":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV.json","graph_json":"https://pith.science/api/pith-number/I7W6KAY4NLHBK4HUT6AKP2C2PV/graph.json","events_json":"https://pith.science/api/pith-number/I7W6KAY4NLHBK4HUT6AKP2C2PV/events.json","paper":"https://pith.science/paper/I7W6KAY4"},"agent_actions":{"view_html":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV","download_json":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV.json","view_paper":"https://pith.science/paper/I7W6KAY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7684&json=true","fetch_graph":"https://pith.science/api/pith-number/I7W6KAY4NLHBK4HUT6AKP2C2PV/graph.json","fetch_events":"https://pith.science/api/pith-number/I7W6KAY4NLHBK4HUT6AKP2C2PV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV/action/storage_attestation","attest_author":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV/action/author_attestation","sign_citation":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV/action/citation_signature","submit_replication":"https://pith.science/pith/I7W6KAY4NLHBK4HUT6AKP2C2PV/action/replication_record"}},"created_at":"2026-05-18T03:42:09.090772+00:00","updated_at":"2026-05-18T03:42:09.090772+00:00"}