{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:63DSLC4U7JLXGBLM25DDPYNLEL","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":"5b55452abe1b77c4d269fe75da4ded2654b00f76414d49b9aefac66b7f90290e","cross_cats_sorted":["cs.DS","math.PR","math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-05-14T08:30:29Z","title_canon_sha256":"651b882fda19f4cb80a1986d3c65c43ceaa8b19391767729bb664aec7e691417"},"schema_version":"1.0","source":{"id":"2405.08421","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.08421","created_at":"2026-07-05T09:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"2405.08421v2","created_at":"2026-07-05T09:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.08421","created_at":"2026-07-05T09:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"63DSLC4U7JLX","created_at":"2026-07-05T09:38:14Z"},{"alias_kind":"pith_short_16","alias_value":"63DSLC4U7JLXGBLM","created_at":"2026-07-05T09:38:14Z"},{"alias_kind":"pith_short_8","alias_value":"63DSLC4U","created_at":"2026-07-05T09:38:14Z"}],"graph_snapshots":[{"event_id":"sha256:9e89ab6e1b8aa8323e8cb01eb301807392366f9d133a10353cc8aa9f02636aee","target":"graph","created_at":"2026-07-05T09:38:14Z","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/2405.08421/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrea Muratori, Guilhem Semerjian","cross_cats":["cs.DS","math.PR","math.ST","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-05-14T08:30:29Z","title":"Faster algorithms for the alignment of sparse correlated Erd\\\"os-R\\'enyi random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.08421","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:f87f2e90167b36c420a7aa5be80d04d49ee025bc4f807dc90ed0ee838e40abad","target":"record","created_at":"2026-07-05T09:38:14Z","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":"5b55452abe1b77c4d269fe75da4ded2654b00f76414d49b9aefac66b7f90290e","cross_cats_sorted":["cs.DS","math.PR","math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-05-14T08:30:29Z","title_canon_sha256":"651b882fda19f4cb80a1986d3c65c43ceaa8b19391767729bb664aec7e691417"},"schema_version":"1.0","source":{"id":"2405.08421","kind":"arxiv","version":2}},"canonical_sha256":"f6c7258b94fa5773056cd74637e1ab22cfaa6a57c122e43b776be058569571eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6c7258b94fa5773056cd74637e1ab22cfaa6a57c122e43b776be058569571eb","first_computed_at":"2026-07-05T09:38:14.936953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:14.936953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VEqEOjiqB7ISpHsSquVoBHqycvSxXwPaoNRK+37QOdLpdsR0kIR2eKLxeIxfCYUgyJz9FxqNGtvSFjlp9r4BBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:14.937448Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.08421","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f87f2e90167b36c420a7aa5be80d04d49ee025bc4f807dc90ed0ee838e40abad","sha256:9e89ab6e1b8aa8323e8cb01eb301807392366f9d133a10353cc8aa9f02636aee"],"state_sha256":"6c57924b9235f6686b0f25d08e8433d1849a2e530c1d7a0fe4360806cd36b8d3"}