{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CQEK6PHNZZTDXFRTJFHBCEXTXF","short_pith_number":"pith:CQEK6PHN","canonical_record":{"source":{"id":"2310.10441","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-16T14:25:43Z","cross_cats_sorted":["math.PR","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"dbd072bc777a2e040826ad411d63efc6690b796246f6161ec4560de7360d016d","abstract_canon_sha256":"c8c78c05acc211201cd924b9fdd0874eb37695be7a0c5f3e9c0bbe6d250ae6f1"},"schema_version":"1.0"},"canonical_sha256":"1408af3cedce663b9633494e1112f3b946738038bfeb2c6909db4b898c94db4e","source":{"kind":"arxiv","id":"2310.10441","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.10441","created_at":"2026-07-05T11:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"2310.10441v2","created_at":"2026-07-05T11:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.10441","created_at":"2026-07-05T11:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"CQEK6PHNZZTD","created_at":"2026-07-05T11:54:38Z"},{"alias_kind":"pith_short_16","alias_value":"CQEK6PHNZZTDXFRT","created_at":"2026-07-05T11:54:38Z"},{"alias_kind":"pith_short_8","alias_value":"CQEK6PHN","created_at":"2026-07-05T11:54:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CQEK6PHNZZTDXFRTJFHBCEXTXF","target":"record","payload":{"canonical_record":{"source":{"id":"2310.10441","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-16T14:25:43Z","cross_cats_sorted":["math.PR","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"dbd072bc777a2e040826ad411d63efc6690b796246f6161ec4560de7360d016d","abstract_canon_sha256":"c8c78c05acc211201cd924b9fdd0874eb37695be7a0c5f3e9c0bbe6d250ae6f1"},"schema_version":"1.0"},"canonical_sha256":"1408af3cedce663b9633494e1112f3b946738038bfeb2c6909db4b898c94db4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:38.088715Z","signature_b64":"CZeM4ejuPV9JxqGjy2Bc/Yiig/h9JDSP4hZ2y0SgmEwcWUP349Q1JsEMgD1H+26xQU0VP11PvTZAKEqHP+ISBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1408af3cedce663b9633494e1112f3b946738038bfeb2c6909db4b898c94db4e","last_reissued_at":"2026-07-05T11:54:38.088215Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:38.088215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.10441","source_version":2,"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-07-05T11:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+QAoVce/nquuLlIDJ2zCLw612iU7sWXyglb3fAqgnIKwLoYUYumgDdbF2h9KkKPJktyiOTYEFDSFjStWdrlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:11:11.095649Z"},"content_sha256":"48b419b13b3f0c29c4d6b2f980dbb99dd900e0def94016669d64f58fa05b9d5b","schema_version":"1.0","event_id":"sha256:48b419b13b3f0c29c4d6b2f980dbb99dd900e0def94016669d64f58fa05b9d5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CQEK6PHNZZTDXFRTJFHBCEXTXF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently matching random inhomogeneous graphs via degree profiles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Jian Ding, Yuanzheng Wang, Yumou Fei","submitted_at":"2023-10-16T14:25:43Z","abstract_excerpt":"In this paper, we study the problem of recovering the latent vertex correspondence between two correlated random graphs with vastly inhomogeneous and unknown edge probabilities between different pairs of vertices. Inspired by and extending the matching algorithm via degree profiles by Ding, Ma, Wu and Xu (2021), we obtain an efficient matching algorithm as long as the minimal average degree is at least $\\Omega(\\log^{2} n)$ and the minimal correlation is at least $1 - O(\\log^{-2} n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.10441","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/2310.10441/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-07-05T11:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B5za9uXNT02wUprv5SPkaRQ27xw9sRZOAYOPnFU2kxj6JRPgO5hkekTyUoiFZo+J/sbXAhG1/4j4QQ3y7BUUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:11:11.096392Z"},"content_sha256":"519dcaaf0e0ef380eccf5de21b96057a030fb5b86b5566a4632c7a9da6f8ec1c","schema_version":"1.0","event_id":"sha256:519dcaaf0e0ef380eccf5de21b96057a030fb5b86b5566a4632c7a9da6f8ec1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQEK6PHNZZTDXFRTJFHBCEXTXF/bundle.json","state_url":"https://pith.science/pith/CQEK6PHNZZTDXFRTJFHBCEXTXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQEK6PHNZZTDXFRTJFHBCEXTXF/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-08-16T23:11:11Z","links":{"resolver":"https://pith.science/pith/CQEK6PHNZZTDXFRTJFHBCEXTXF","bundle":"https://pith.science/pith/CQEK6PHNZZTDXFRTJFHBCEXTXF/bundle.json","state":"https://pith.science/pith/CQEK6PHNZZTDXFRTJFHBCEXTXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQEK6PHNZZTDXFRTJFHBCEXTXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CQEK6PHNZZTDXFRTJFHBCEXTXF","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":"c8c78c05acc211201cd924b9fdd0874eb37695be7a0c5f3e9c0bbe6d250ae6f1","cross_cats_sorted":["math.PR","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-16T14:25:43Z","title_canon_sha256":"dbd072bc777a2e040826ad411d63efc6690b796246f6161ec4560de7360d016d"},"schema_version":"1.0","source":{"id":"2310.10441","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.10441","created_at":"2026-07-05T11:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"2310.10441v2","created_at":"2026-07-05T11:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.10441","created_at":"2026-07-05T11:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"CQEK6PHNZZTD","created_at":"2026-07-05T11:54:38Z"},{"alias_kind":"pith_short_16","alias_value":"CQEK6PHNZZTDXFRT","created_at":"2026-07-05T11:54:38Z"},{"alias_kind":"pith_short_8","alias_value":"CQEK6PHN","created_at":"2026-07-05T11:54:38Z"}],"graph_snapshots":[{"event_id":"sha256:519dcaaf0e0ef380eccf5de21b96057a030fb5b86b5566a4632c7a9da6f8ec1c","target":"graph","created_at":"2026-07-05T11:54:38Z","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/2310.10441/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the problem of recovering the latent vertex correspondence between two correlated random graphs with vastly inhomogeneous and unknown edge probabilities between different pairs of vertices. Inspired by and extending the matching algorithm via degree profiles by Ding, Ma, Wu and Xu (2021), we obtain an efficient matching algorithm as long as the minimal average degree is at least $\\Omega(\\log^{2} n)$ and the minimal correlation is at least $1 - O(\\log^{-2} n)$.","authors_text":"Jian Ding, Yuanzheng Wang, Yumou Fei","cross_cats":["math.PR","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-16T14:25:43Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.10441","kind":"arxiv","version":2},"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:48b419b13b3f0c29c4d6b2f980dbb99dd900e0def94016669d64f58fa05b9d5b","target":"record","created_at":"2026-07-05T11:54:38Z","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":"c8c78c05acc211201cd924b9fdd0874eb37695be7a0c5f3e9c0bbe6d250ae6f1","cross_cats_sorted":["math.PR","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-16T14:25:43Z","title_canon_sha256":"dbd072bc777a2e040826ad411d63efc6690b796246f6161ec4560de7360d016d"},"schema_version":"1.0","source":{"id":"2310.10441","kind":"arxiv","version":2}},"canonical_sha256":"1408af3cedce663b9633494e1112f3b946738038bfeb2c6909db4b898c94db4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1408af3cedce663b9633494e1112f3b946738038bfeb2c6909db4b898c94db4e","first_computed_at":"2026-07-05T11:54:38.088215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:54:38.088215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CZeM4ejuPV9JxqGjy2Bc/Yiig/h9JDSP4hZ2y0SgmEwcWUP349Q1JsEMgD1H+26xQU0VP11PvTZAKEqHP+ISBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:54:38.088715Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.10441","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48b419b13b3f0c29c4d6b2f980dbb99dd900e0def94016669d64f58fa05b9d5b","sha256:519dcaaf0e0ef380eccf5de21b96057a030fb5b86b5566a4632c7a9da6f8ec1c"],"state_sha256":"a94ca6c6d53f633c2c0cbcfe99328866c30cd72e90837501bce7a9ec0a2f2ed4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LxChMXTv08Q5M7QfuC/SNi7LVIRPIBKK/UTjcA6o3OkOoR/SrgwsY9URklWO68XBpPTqhAG+XVoZ3+xWNAktDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T23:11:11.101496Z","bundle_sha256":"077ec3451f49b96fa39d6a5959a6d1b304bfb7118096e735619db9feb30a811f"}}