{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XKWK7CEP222LH5EL6YSW445OSU","short_pith_number":"pith:XKWK7CEP","canonical_record":{"source":{"id":"1807.11027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-29T09:25:37Z","cross_cats_sorted":["cs.CC","cs.LG","math.ST","stat.ME","stat.TH"],"title_canon_sha256":"bac33abd3216edaf43103cd69850c34245953e9eb08f9d2a66d4e06203d36fc2","abstract_canon_sha256":"84c5cb4d3760c21d09ddb3672216ffb260cf2dfa9c118f8eb5361420cfcbcdda"},"schema_version":"1.0"},"canonical_sha256":"baacaf888fd6b4b3f48bf6256e73ae953543ddbd62f9addb8f51af0c7579413d","source":{"kind":"arxiv","id":"1807.11027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11027","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11027v1","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11027","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"pith_short_12","alias_value":"XKWK7CEP222L","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XKWK7CEP222LH5EL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XKWK7CEP","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XKWK7CEP222LH5EL6YSW445OSU","target":"record","payload":{"canonical_record":{"source":{"id":"1807.11027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-29T09:25:37Z","cross_cats_sorted":["cs.CC","cs.LG","math.ST","stat.ME","stat.TH"],"title_canon_sha256":"bac33abd3216edaf43103cd69850c34245953e9eb08f9d2a66d4e06203d36fc2","abstract_canon_sha256":"84c5cb4d3760c21d09ddb3672216ffb260cf2dfa9c118f8eb5361420cfcbcdda"},"schema_version":"1.0"},"canonical_sha256":"baacaf888fd6b4b3f48bf6256e73ae953543ddbd62f9addb8f51af0c7579413d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:27.366358Z","signature_b64":"Phj1RZxkx1ONJTJSFJdIVO4o0dV1E3ZG0dpRkuzq0zxplJnXZ7XzGVpKZOsC/wU45ZQfQq69gbq9HfegDCFOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baacaf888fd6b4b3f48bf6256e73ae953543ddbd62f9addb8f51af0c7579413d","last_reissued_at":"2026-05-18T00:07:27.365685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:27.365685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.11027","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-18T00:07:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EsncOYX6yKoZArc5sgCw+UDLPJr4FbyUQSsc+ex7F1V0ZnX6z7s0w9uhCRmuSmERW5cS5ucJKqR4gAAX/J3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:50:33.940669Z"},"content_sha256":"5ef6e10f2fc60c5ab3d5d859861f3d99abef286803725bce8a35c5e11069b95b","schema_version":"1.0","event_id":"sha256:5ef6e10f2fc60c5ab3d5d859861f3d99abef286803725bce8a35c5e11069b95b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XKWK7CEP222LH5EL6YSW445OSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consistent polynomial-time unseeded graph matching for Lipschitz graphons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","math.ST","stat.ME","stat.TH"],"primary_cat":"stat.ML","authors_text":"Yuan Zhang","submitted_at":"2018-07-29T09:25:37Z","abstract_excerpt":"We propose a consistent polynomial-time method for the unseeded node matching problem for networks with smooth underlying structures. Despite widely conjectured by the research community that the structured graph matching problem to be significantly easier than its worst case counterpart, well-known to be NP-hard, the statistical version of the problem has stood a challenge that resisted any solution both provable and polynomial-time. The closest existing work requires quasi-polynomial time. Our method is based on the latest advances in graphon estimation techniques and analysis on the concent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11027","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-18T00:07:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5S884vP8lr4+KMId1gIBPFwc/uxCimMWN4n5HaVcGLqwBnNM8p3loyyoGlXTOZseYhJ9HfwQ40whD92Is3z/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:50:33.941028Z"},"content_sha256":"03e203dadc498773ef820606aaafa35d286c22f1c808c3ea938eba6a4f187221","schema_version":"1.0","event_id":"sha256:03e203dadc498773ef820606aaafa35d286c22f1c808c3ea938eba6a4f187221"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XKWK7CEP222LH5EL6YSW445OSU/bundle.json","state_url":"https://pith.science/pith/XKWK7CEP222LH5EL6YSW445OSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XKWK7CEP222LH5EL6YSW445OSU/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-21T23:50:33Z","links":{"resolver":"https://pith.science/pith/XKWK7CEP222LH5EL6YSW445OSU","bundle":"https://pith.science/pith/XKWK7CEP222LH5EL6YSW445OSU/bundle.json","state":"https://pith.science/pith/XKWK7CEP222LH5EL6YSW445OSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XKWK7CEP222LH5EL6YSW445OSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XKWK7CEP222LH5EL6YSW445OSU","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":"84c5cb4d3760c21d09ddb3672216ffb260cf2dfa9c118f8eb5361420cfcbcdda","cross_cats_sorted":["cs.CC","cs.LG","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-29T09:25:37Z","title_canon_sha256":"bac33abd3216edaf43103cd69850c34245953e9eb08f9d2a66d4e06203d36fc2"},"schema_version":"1.0","source":{"id":"1807.11027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11027","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11027v1","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11027","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"pith_short_12","alias_value":"XKWK7CEP222L","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XKWK7CEP222LH5EL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XKWK7CEP","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:03e203dadc498773ef820606aaafa35d286c22f1c808c3ea938eba6a4f187221","target":"graph","created_at":"2026-05-18T00:07:27Z","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":"We propose a consistent polynomial-time method for the unseeded node matching problem for networks with smooth underlying structures. Despite widely conjectured by the research community that the structured graph matching problem to be significantly easier than its worst case counterpart, well-known to be NP-hard, the statistical version of the problem has stood a challenge that resisted any solution both provable and polynomial-time. The closest existing work requires quasi-polynomial time. Our method is based on the latest advances in graphon estimation techniques and analysis on the concent","authors_text":"Yuan Zhang","cross_cats":["cs.CC","cs.LG","math.ST","stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-29T09:25:37Z","title":"Consistent polynomial-time unseeded graph matching for Lipschitz graphons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11027","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:5ef6e10f2fc60c5ab3d5d859861f3d99abef286803725bce8a35c5e11069b95b","target":"record","created_at":"2026-05-18T00:07:27Z","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":"84c5cb4d3760c21d09ddb3672216ffb260cf2dfa9c118f8eb5361420cfcbcdda","cross_cats_sorted":["cs.CC","cs.LG","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-29T09:25:37Z","title_canon_sha256":"bac33abd3216edaf43103cd69850c34245953e9eb08f9d2a66d4e06203d36fc2"},"schema_version":"1.0","source":{"id":"1807.11027","kind":"arxiv","version":1}},"canonical_sha256":"baacaf888fd6b4b3f48bf6256e73ae953543ddbd62f9addb8f51af0c7579413d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baacaf888fd6b4b3f48bf6256e73ae953543ddbd62f9addb8f51af0c7579413d","first_computed_at":"2026-05-18T00:07:27.365685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:27.365685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Phj1RZxkx1ONJTJSFJdIVO4o0dV1E3ZG0dpRkuzq0zxplJnXZ7XzGVpKZOsC/wU45ZQfQq69gbq9HfegDCFOAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:27.366358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.11027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ef6e10f2fc60c5ab3d5d859861f3d99abef286803725bce8a35c5e11069b95b","sha256:03e203dadc498773ef820606aaafa35d286c22f1c808c3ea938eba6a4f187221"],"state_sha256":"4c43b8e2a1d69293dd1fd245c1e790aa979628ac73993cbf939abfe18d99b11e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPZqcql+1hvER9hUnHUu8yG/WSrQCtLIaZXEn95b41haE43kGHrQwc/849UmBCgSOwa0MpnaFHdx0k0wSpqmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T23:50:33.943256Z","bundle_sha256":"81a57a783d936c114149ce52c8827862e219bf25ae6fe70d6b9c04c1163ace08"}}