{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:63DSLC4U7JLXGBLM25DDPYNLEL","short_pith_number":"pith:63DSLC4U","schema_version":"1.0","canonical_sha256":"f6c7258b94fa5773056cd74637e1ab22cfaa6a57c122e43b776be058569571eb","source":{"kind":"arxiv","id":"2405.08421","version":2},"attestation_state":"computed","paper":{"title":"Faster algorithms for the alignment of sparse correlated Erd\\\"os-R\\'enyi random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.PR","math.ST","stat.TH"],"primary_cat":"cond-mat.dis-nn","authors_text":"Andrea Muratori, Guilhem Semerjian","submitted_at":"2024-05-14T08:30:29Z","abstract_excerpt":"The correlated Erd\\\"os-R\\'enyi random graph ensemble is a probability law on pairs of graphs with $n$ vertices, parametrized by their average degree $\\lambda$ and their correlation coefficient $s$. It can be used as a benchmark for the graph alignment problem, in which the labels of the vertices of one of the graphs are reshuffled by an unknown permutation; the goal is to infer this permutation and thus properly match the pairs of vertices in both graphs. A series of recent works has unveiled the role of Otter's constant $\\alpha$ (that controls the exponential rate of growth of the number of u"},"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":"2405.08421","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-05-14T08:30:29Z","cross_cats_sorted":["cs.DS","math.PR","math.ST","stat.TH"],"title_canon_sha256":"651b882fda19f4cb80a1986d3c65c43ceaa8b19391767729bb664aec7e691417","abstract_canon_sha256":"5b55452abe1b77c4d269fe75da4ded2654b00f76414d49b9aefac66b7f90290e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:14.937448Z","signature_b64":"VEqEOjiqB7ISpHsSquVoBHqycvSxXwPaoNRK+37QOdLpdsR0kIR2eKLxeIxfCYUgyJz9FxqNGtvSFjlp9r4BBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6c7258b94fa5773056cd74637e1ab22cfaa6a57c122e43b776be058569571eb","last_reissued_at":"2026-07-05T09:38:14.936953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:14.936953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster algorithms for the alignment of sparse correlated Erd\\\"os-R\\'enyi random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.PR","math.ST","stat.TH"],"primary_cat":"cond-mat.dis-nn","authors_text":"Andrea Muratori, Guilhem Semerjian","submitted_at":"2024-05-14T08:30:29Z","abstract_excerpt":"The correlated Erd\\\"os-R\\'enyi random graph ensemble is a probability law on pairs of graphs with $n$ vertices, parametrized by their average degree $\\lambda$ and their correlation coefficient $s$. It can be used as a benchmark for the graph alignment problem, in which the labels of the vertices of one of the graphs are reshuffled by an unknown permutation; the goal is to infer this permutation and thus properly match the pairs of vertices in both graphs. A series of recent works has unveiled the role of Otter's constant $\\alpha$ (that controls the exponential rate of growth of the number of u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.08421","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/2405.08421/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":"2405.08421","created_at":"2026-07-05T09:38:14.937008+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.08421v2","created_at":"2026-07-05T09:38:14.937008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.08421","created_at":"2026-07-05T09:38:14.937008+00:00"},{"alias_kind":"pith_short_12","alias_value":"63DSLC4U7JLX","created_at":"2026-07-05T09:38:14.937008+00:00"},{"alias_kind":"pith_short_16","alias_value":"63DSLC4U7JLXGBLM","created_at":"2026-07-05T09:38:14.937008+00:00"},{"alias_kind":"pith_short_8","alias_value":"63DSLC4U","created_at":"2026-07-05T09:38:14.937008+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14138","citing_title":"Sample Complexity of Correlation Detection in the Gaussian Wigner Model","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/63DSLC4U7JLXGBLM25DDPYNLEL","json":"https://pith.science/pith/63DSLC4U7JLXGBLM25DDPYNLEL.json","graph_json":"https://pith.science/api/pith-number/63DSLC4U7JLXGBLM25DDPYNLEL/graph.json","events_json":"https://pith.science/api/pith-number/63DSLC4U7JLXGBLM25DDPYNLEL/events.json","paper":"https://pith.science/paper/63DSLC4U"},"agent_actions":{"view_html":"https://pith.science/pith/63DSLC4U7JLXGBLM25DDPYNLEL","download_json":"https://pith.science/pith/63DSLC4U7JLXGBLM25DDPYNLEL.json","view_paper":"https://pith.science/paper/63DSLC4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.08421&json=true","fetch_graph":"https://pith.science/api/pith-number/63DSLC4U7JLXGBLM25DDPYNLEL/graph.json","fetch_events":"https://pith.science/api/pith-number/63DSLC4U7JLXGBLM25DDPYNLEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63DSLC4U7JLXGBLM25DDPYNLEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63DSLC4U7JLXGBLM25DDPYNLEL/action/storage_attestation","attest_author":"https://pith.science/pith/63DSLC4U7JLXGBLM25DDPYNLEL/action/author_attestation","sign_citation":"https://pith.science/pith/63DSLC4U7JLXGBLM25DDPYNLEL/action/citation_signature","submit_replication":"https://pith.science/pith/63DSLC4U7JLXGBLM25DDPYNLEL/action/replication_record"}},"created_at":"2026-07-05T09:38:14.937008+00:00","updated_at":"2026-07-05T09:38:14.937008+00:00"}