{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EFYRZE4UVVFY5UH6MQ5WCSXJKN","short_pith_number":"pith:EFYRZE4U","canonical_record":{"source":{"id":"1807.04680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-07-12T15:37:32Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"4c23bdd171f2ce7eb5ce89d570f308a912e9f36b1bc225f38bb4cf09a1943e26","abstract_canon_sha256":"0abc6fe86317143d828d758ce2a13f3e315be46652e6952109fa885f48ccc0ba"},"schema_version":"1.0"},"canonical_sha256":"21711c9394ad4b8ed0fe643b614ae95368ee6c3e0c1fcc179b42f88dfef8f41d","source":{"kind":"arxiv","id":"1807.04680","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04680","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04680v1","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04680","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"pith_short_12","alias_value":"EFYRZE4UVVFY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EFYRZE4UVVFY5UH6","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EFYRZE4U","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EFYRZE4UVVFY5UH6MQ5WCSXJKN","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-07-12T15:37:32Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"4c23bdd171f2ce7eb5ce89d570f308a912e9f36b1bc225f38bb4cf09a1943e26","abstract_canon_sha256":"0abc6fe86317143d828d758ce2a13f3e315be46652e6952109fa885f48ccc0ba"},"schema_version":"1.0"},"canonical_sha256":"21711c9394ad4b8ed0fe643b614ae95368ee6c3e0c1fcc179b42f88dfef8f41d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:27.453156Z","signature_b64":"PbgEKGF4RfUMD3VFuVaNdOCdsqXorouasS+O7FjXh7BAA8BX9+JYSNIi6Nn+kOraGXNW4SRdSmMrbEStXfHtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21711c9394ad4b8ed0fe643b614ae95368ee6c3e0c1fcc179b42f88dfef8f41d","last_reissued_at":"2026-05-18T00:07:27.452588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:27.452588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04680","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":"TpVmMOy6I8esJlPQTMcS2HG6yteEn4OiGW5OvOHngTaVMv7oatfGSu/b3f8DjEFGtpe9uZCfLFkSE5R8TNxbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:55:07.972117Z"},"content_sha256":"af7106e7d9b1f5d7aa41401f714d7957e01a9adf49897672bc5e05bd9971f988","schema_version":"1.0","event_id":"sha256:af7106e7d9b1f5d7aa41401f714d7957e01a9adf49897672bc5e05bd9971f988"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EFYRZE4UVVFY5UH6MQ5WCSXJKN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unseeded low-rank graph matching by transform-based unsupervised point registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.ME","authors_text":"Yuan Zhang","submitted_at":"2018-07-12T15:37:32Z","abstract_excerpt":"The problem of learning a correspondence relationship between nodes of two networks has drawn much attention of the computer science community and recently that of statisticians. The unseeded version of this problem, in which we do not know any part of the true correspondence, is a long-standing challenge. For low-rank networks, the problem can be translated into an unsupervised point registration problem, in which two point sets generated from the same distribution are matchable by an unknown orthonormal transformation. Conventional methods generally lack consistency guarantee and are usually"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04680","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":"xD4++L6IaQyGvYQl4oqFgdH/uUEpLKCP4R7qPGdL3oqUno2hnSnX8GbMPMEuD0LnIVScl4VfeBJwsqRQeZ1/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:55:07.972528Z"},"content_sha256":"858400301f90cb2f1752cc13d4475ba4c039c37f33979064b3b63dce871a4ee3","schema_version":"1.0","event_id":"sha256:858400301f90cb2f1752cc13d4475ba4c039c37f33979064b3b63dce871a4ee3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFYRZE4UVVFY5UH6MQ5WCSXJKN/bundle.json","state_url":"https://pith.science/pith/EFYRZE4UVVFY5UH6MQ5WCSXJKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFYRZE4UVVFY5UH6MQ5WCSXJKN/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-06-05T12:55:07Z","links":{"resolver":"https://pith.science/pith/EFYRZE4UVVFY5UH6MQ5WCSXJKN","bundle":"https://pith.science/pith/EFYRZE4UVVFY5UH6MQ5WCSXJKN/bundle.json","state":"https://pith.science/pith/EFYRZE4UVVFY5UH6MQ5WCSXJKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFYRZE4UVVFY5UH6MQ5WCSXJKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EFYRZE4UVVFY5UH6MQ5WCSXJKN","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":"0abc6fe86317143d828d758ce2a13f3e315be46652e6952109fa885f48ccc0ba","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-07-12T15:37:32Z","title_canon_sha256":"4c23bdd171f2ce7eb5ce89d570f308a912e9f36b1bc225f38bb4cf09a1943e26"},"schema_version":"1.0","source":{"id":"1807.04680","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04680","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04680v1","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04680","created_at":"2026-05-18T00:07:27Z"},{"alias_kind":"pith_short_12","alias_value":"EFYRZE4UVVFY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EFYRZE4UVVFY5UH6","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EFYRZE4U","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:858400301f90cb2f1752cc13d4475ba4c039c37f33979064b3b63dce871a4ee3","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":"The problem of learning a correspondence relationship between nodes of two networks has drawn much attention of the computer science community and recently that of statisticians. The unseeded version of this problem, in which we do not know any part of the true correspondence, is a long-standing challenge. For low-rank networks, the problem can be translated into an unsupervised point registration problem, in which two point sets generated from the same distribution are matchable by an unknown orthonormal transformation. Conventional methods generally lack consistency guarantee and are usually","authors_text":"Yuan Zhang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-07-12T15:37:32Z","title":"Unseeded low-rank graph matching by transform-based unsupervised point registration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04680","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:af7106e7d9b1f5d7aa41401f714d7957e01a9adf49897672bc5e05bd9971f988","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":"0abc6fe86317143d828d758ce2a13f3e315be46652e6952109fa885f48ccc0ba","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-07-12T15:37:32Z","title_canon_sha256":"4c23bdd171f2ce7eb5ce89d570f308a912e9f36b1bc225f38bb4cf09a1943e26"},"schema_version":"1.0","source":{"id":"1807.04680","kind":"arxiv","version":1}},"canonical_sha256":"21711c9394ad4b8ed0fe643b614ae95368ee6c3e0c1fcc179b42f88dfef8f41d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21711c9394ad4b8ed0fe643b614ae95368ee6c3e0c1fcc179b42f88dfef8f41d","first_computed_at":"2026-05-18T00:07:27.452588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:27.452588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PbgEKGF4RfUMD3VFuVaNdOCdsqXorouasS+O7FjXh7BAA8BX9+JYSNIi6Nn+kOraGXNW4SRdSmMrbEStXfHtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:27.453156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04680","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af7106e7d9b1f5d7aa41401f714d7957e01a9adf49897672bc5e05bd9971f988","sha256:858400301f90cb2f1752cc13d4475ba4c039c37f33979064b3b63dce871a4ee3"],"state_sha256":"2e50183cf589f31a20282302ba4246170e7edfc5b0b82afdd9edb1cc36d52e62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MMQ+xlL2EuYSo5QqWApdQkLGI3atPkDVTXgEj/WPcx2Gc5SYt5otC0nHpzH6KBljHJf73tzHDBM55WbyrOfjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:55:07.974538Z","bundle_sha256":"864396426763bac28f5f6c0844bcc1a5b86bc4598669cfb06526e91e8c11fff8"}}