{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OXMQ7QEWIHFVPH6NST2SRU47HA","short_pith_number":"pith:OXMQ7QEW","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"},"canonical_sha256":"75d90fc09641cb579fcd94f528d39f38239a06306850a7088eddd1520faa7aeb","source":{"kind":"arxiv","id":"2512.17417","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.17417","created_at":"2026-05-21T01:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"2512.17417v3","created_at":"2026-05-21T01:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.17417","created_at":"2026-05-21T01:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"OXMQ7QEWIHFV","created_at":"2026-05-21T01:05:13Z"},{"alias_kind":"pith_short_16","alias_value":"OXMQ7QEWIHFVPH6N","created_at":"2026-05-21T01:05:13Z"},{"alias_kind":"pith_short_8","alias_value":"OXMQ7QEW","created_at":"2026-05-21T01:05:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OXMQ7QEWIHFVPH6NST2SRU47HA","target":"record","payload":{"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"},"canonical_sha256":"75d90fc09641cb579fcd94f528d39f38239a06306850a7088eddd1520faa7aeb","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"},"source_kind":"arxiv","source_id":"2512.17417","source_version":3,"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-21T01:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/pF5dfa/Xebnx+ERDtGxfXGI4Qn6rj7cy9ZPydGK3brnrmfxv/ZPKSF/XEPXeanbeCvxuk+L+s6VZ8Mqk1B1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:23:37.088527Z"},"content_sha256":"3d5a15f596bb75200be06eced9fcd21b30dc94d5e6371b2b59d7a84b7e4aa29b","schema_version":"1.0","event_id":"sha256:3d5a15f596bb75200be06eced9fcd21b30dc94d5e6371b2b59d7a84b7e4aa29b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OXMQ7QEWIHFVPH6NST2SRU47HA","target":"graph","payload":{"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"},"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-21T01:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ySu6GNpNi6kCJj7RkSXJZKBnrbkctQ00X3LNnjIFpgZ3r192n5/1uhdFNBINhUTUpxepyiBvDUmt224XiSOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:23:37.089307Z"},"content_sha256":"3174bbf505c2bd2830c9a3926883293aa25a0c59a012667f0dcb73c09b363fa1","schema_version":"1.0","event_id":"sha256:3174bbf505c2bd2830c9a3926883293aa25a0c59a012667f0dcb73c09b363fa1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA/bundle.json","state_url":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXMQ7QEWIHFVPH6NST2SRU47HA/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-24T22:23:37Z","links":{"resolver":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA","bundle":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA/bundle.json","state":"https://pith.science/pith/OXMQ7QEWIHFVPH6NST2SRU47HA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXMQ7QEWIHFVPH6NST2SRU47HA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OXMQ7QEWIHFVPH6NST2SRU47HA","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":"8109ef6eb9e014f7ce996b3f1bf32de516483ea9453a9f839dcf876e578b6ee2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-19T10:14:16Z","title_canon_sha256":"4cc7dd981a6312f7dae162393a5e3f2bbf7178d61db151cf8a17e3a1ef8bba83"},"schema_version":"1.0","source":{"id":"2512.17417","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.17417","created_at":"2026-05-21T01:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"2512.17417v3","created_at":"2026-05-21T01:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.17417","created_at":"2026-05-21T01:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"OXMQ7QEWIHFV","created_at":"2026-05-21T01:05:13Z"},{"alias_kind":"pith_short_16","alias_value":"OXMQ7QEWIHFVPH6N","created_at":"2026-05-21T01:05:13Z"},{"alias_kind":"pith_short_8","alias_value":"OXMQ7QEW","created_at":"2026-05-21T01:05:13Z"}],"graph_snapshots":[{"event_id":"sha256:3174bbf505c2bd2830c9a3926883293aa25a0c59a012667f0dcb73c09b363fa1","target":"graph","created_at":"2026-05-21T01:05:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2512.17417/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Deborah Hendrych, Mathieu Besan\\c{c}on, Patrick Gel{\\ss}, Sebastian Pokutta, Stefan Klus, Wenjie Xiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-19T10:14:16Z","title":"Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.17417","kind":"arxiv","version":3},"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:3d5a15f596bb75200be06eced9fcd21b30dc94d5e6371b2b59d7a84b7e4aa29b","target":"record","created_at":"2026-05-21T01:05:13Z","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":"8109ef6eb9e014f7ce996b3f1bf32de516483ea9453a9f839dcf876e578b6ee2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-19T10:14:16Z","title_canon_sha256":"4cc7dd981a6312f7dae162393a5e3f2bbf7178d61db151cf8a17e3a1ef8bba83"},"schema_version":"1.0","source":{"id":"2512.17417","kind":"arxiv","version":3}},"canonical_sha256":"75d90fc09641cb579fcd94f528d39f38239a06306850a7088eddd1520faa7aeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75d90fc09641cb579fcd94f528d39f38239a06306850a7088eddd1520faa7aeb","first_computed_at":"2026-05-21T01:05:13.891275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:13.891275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YDigE6i2UHB54YJRxzUCXHbAlC29OO+CJJDJ5RmIpAtkQWuibzuFedrv2ASGyEPCeqR60VBG27wIOwnsC1WEDw==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:13.892116Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.17417","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d5a15f596bb75200be06eced9fcd21b30dc94d5e6371b2b59d7a84b7e4aa29b","sha256:3174bbf505c2bd2830c9a3926883293aa25a0c59a012667f0dcb73c09b363fa1"],"state_sha256":"358b7609f49a6de06bb2b72318e55f80d6fd6386b878e1c807a7bbc25697f3fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rHr5IcVjgY+otYTpic1b1k3/EGiFPRmn8CONMMTxRXibr/xf/XVUfTLlgAnGvVeGnioO02DxTqkHVBYcGukQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T22:23:37.093622Z","bundle_sha256":"8dab6379143801ea4eee3656e7fa96258e9fd13d46cb7afa2114a8f19eecb5cb"}}