{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OXMQ7QEWIHFVPH6NST2SRU47HA","short_pith_number":"pith:OXMQ7QEW","schema_version":"1.0","canonical_sha256":"75d90fc09641cb579fcd94f528d39f38239a06306850a7088eddd1520faa7aeb","source":{"kind":"arxiv","id":"2512.17417","version":3},"attestation_state":"computed","paper":{"title":"Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Deborah Hendrych, Mathieu Besan\\c{c}on, Patrick Gel{\\ss}, Sebastian Pokutta, Stefan Klus, Wenjie Xiao","submitted_at":"2025-12-19T10:14:16Z","abstract_excerpt":"The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be solvable in polynomial time, nor proven to be NP-complete. We propose a convex mixed-integer formulation of the problem and leverage first-order convex optimization to tackle it, following a stream of recent work on optimization-driven graph isomorphism detection. We strengthen our formulation with variable fixing techniques that prove highly effective while preserving the polyhedral structure. We perform extensive com"},"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":"2512.17417","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-19T10:14:16Z","cross_cats_sorted":[],"title_canon_sha256":"4cc7dd981a6312f7dae162393a5e3f2bbf7178d61db151cf8a17e3a1ef8bba83","abstract_canon_sha256":"8109ef6eb9e014f7ce996b3f1bf32de516483ea9453a9f839dcf876e578b6ee2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:13.892116Z","signature_b64":"YDigE6i2UHB54YJRxzUCXHbAlC29OO+CJJDJ5RmIpAtkQWuibzuFedrv2ASGyEPCeqR60VBG27wIOwnsC1WEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75d90fc09641cb579fcd94f528d39f38239a06306850a7088eddd1520faa7aeb","last_reissued_at":"2026-05-21T01:05:13.891275Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:13.891275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Deborah Hendrych, Mathieu Besan\\c{c}on, Patrick Gel{\\ss}, Sebastian Pokutta, Stefan Klus, Wenjie Xiao","submitted_at":"2025-12-19T10:14:16Z","abstract_excerpt":"The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be solvable in polynomial time, nor proven to be NP-complete. We propose a convex mixed-integer formulation of the problem and leverage first-order convex optimization to tackle it, following a stream of recent work on optimization-driven graph isomorphism detection. We strengthen our formulation with variable fixing techniques that prove highly effective while preserving the polyhedral structure. We perform extensive com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.17417","kind":"arxiv","version":3},"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/2512.17417/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":"2512.17417","created_at":"2026-05-21T01:05:13.891426+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.17417v3","created_at":"2026-05-21T01:05:13.891426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.17417","created_at":"2026-05-21T01:05:13.891426+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXMQ7QEWIHFV","created_at":"2026-05-21T01:05:13.891426+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXMQ7QEWIHFVPH6N","created_at":"2026-05-21T01:05:13.891426+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXMQ7QEW","created_at":"2026-05-21T01:05:13.891426+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/OXMQ7QEWIHFVPH6NST2SRU47HA","json":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA.json","graph_json":"https://pith.science/api/pith-number/OXMQ7QEWIHFVPH6NST2SRU47HA/graph.json","events_json":"https://pith.science/api/pith-number/OXMQ7QEWIHFVPH6NST2SRU47HA/events.json","paper":"https://pith.science/paper/OXMQ7QEW"},"agent_actions":{"view_html":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA","download_json":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA.json","view_paper":"https://pith.science/paper/OXMQ7QEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.17417&json=true","fetch_graph":"https://pith.science/api/pith-number/OXMQ7QEWIHFVPH6NST2SRU47HA/graph.json","fetch_events":"https://pith.science/api/pith-number/OXMQ7QEWIHFVPH6NST2SRU47HA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA/action/storage_attestation","attest_author":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA/action/author_attestation","sign_citation":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA/action/citation_signature","submit_replication":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA/action/replication_record"}},"created_at":"2026-05-21T01:05:13.891426+00:00","updated_at":"2026-05-21T01:05:13.891426+00:00"}