{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:45NSLHAJKJJX6FN4VKGFS7FQMQ","short_pith_number":"pith:45NSLHAJ","schema_version":"1.0","canonical_sha256":"e75b259c0952537f15bcaa8c597cb0642acad73fa89e5991a4c5e9f7c01fd801","source":{"kind":"arxiv","id":"1908.06320","version":2},"attestation_state":"computed","paper":{"title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Giannis Nikolentzos, Michalis Vazirgiannis","submitted_at":"2019-08-17T17:08:57Z","abstract_excerpt":"It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for this problem are either not efficient or not exact. In this paper, we present a new algorithm which solves this equivalent formulation via semidefinite programming. Specifically, we show that the problem of determining whether the auxiliary graph contains a clique of specific order can be formulated as a semidefinite programming problem, and can thus be (almo"},"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":"1908.06320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-17T17:08:57Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ce5beef042df6c546c53db130ad9077064342e19332643adcbc1242fdcb37c37","abstract_canon_sha256":"cfad1b0d1d6ca52d226b232e7cb4ece49c0c97484f78486451b43da5754fd7db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:08.016324Z","signature_b64":"wTwPlFPB9U4BMRmQDNkBtwfKRKotqeTXQ5SiUiVUPWaqa6rTY8VIn1ZsX45grX7zIrgNceQy1dBClkusb+nyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e75b259c0952537f15bcaa8c597cb0642acad73fa89e5991a4c5e9f7c01fd801","last_reissued_at":"2026-07-05T00:15:08.015934Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:08.015934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Giannis Nikolentzos, Michalis Vazirgiannis","submitted_at":"2019-08-17T17:08:57Z","abstract_excerpt":"It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for this problem are either not efficient or not exact. In this paper, we present a new algorithm which solves this equivalent formulation via semidefinite programming. Specifically, we show that the problem of determining whether the auxiliary graph contains a clique of specific order can be formulated as a semidefinite programming problem, and can thus be (almo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06320","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06320/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.06320","created_at":"2026-07-05T00:15:08.015992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06320v2","created_at":"2026-07-05T00:15:08.015992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06320","created_at":"2026-07-05T00:15:08.015992+00:00"},{"alias_kind":"pith_short_12","alias_value":"45NSLHAJKJJX","created_at":"2026-07-05T00:15:08.015992+00:00"},{"alias_kind":"pith_short_16","alias_value":"45NSLHAJKJJX6FN4","created_at":"2026-07-05T00:15:08.015992+00:00"},{"alias_kind":"pith_short_8","alias_value":"45NSLHAJ","created_at":"2026-07-05T00:15:08.015992+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/45NSLHAJKJJX6FN4VKGFS7FQMQ","json":"https://pith.science/pith/45NSLHAJKJJX6FN4VKGFS7FQMQ.json","graph_json":"https://pith.science/api/pith-number/45NSLHAJKJJX6FN4VKGFS7FQMQ/graph.json","events_json":"https://pith.science/api/pith-number/45NSLHAJKJJX6FN4VKGFS7FQMQ/events.json","paper":"https://pith.science/paper/45NSLHAJ"},"agent_actions":{"view_html":"https://pith.science/pith/45NSLHAJKJJX6FN4VKGFS7FQMQ","download_json":"https://pith.science/pith/45NSLHAJKJJX6FN4VKGFS7FQMQ.json","view_paper":"https://pith.science/paper/45NSLHAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06320&json=true","fetch_graph":"https://pith.science/api/pith-number/45NSLHAJKJJX6FN4VKGFS7FQMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/45NSLHAJKJJX6FN4VKGFS7FQMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45NSLHAJKJJX6FN4VKGFS7FQMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45NSLHAJKJJX6FN4VKGFS7FQMQ/action/storage_attestation","attest_author":"https://pith.science/pith/45NSLHAJKJJX6FN4VKGFS7FQMQ/action/author_attestation","sign_citation":"https://pith.science/pith/45NSLHAJKJJX6FN4VKGFS7FQMQ/action/citation_signature","submit_replication":"https://pith.science/pith/45NSLHAJKJJX6FN4VKGFS7FQMQ/action/replication_record"}},"created_at":"2026-07-05T00:15:08.015992+00:00","updated_at":"2026-07-05T00:15:08.015992+00:00"}