{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:A4AZ7LRBSZBJ3SUO2L4MAQTXT6","short_pith_number":"pith:A4AZ7LRB","schema_version":"1.0","canonical_sha256":"07019fae2196429dca8ed2f8c042779f9efc1bfdd24ea190758e8555d0de1e18","source":{"kind":"arxiv","id":"2607.14948","version":1},"attestation_state":"computed","paper":{"title":"Graph alignment in sparse inhomogeneous models via self-overlap","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Louis Vassaux","submitted_at":"2026-07-16T12:57:28Z","abstract_excerpt":"We develop a general framework for understanding when graph alignment is information-theoretically feasible in sparse inhomogeneous random graph models, by studying the set of vertices on which the underlying matching can be recovered. Our main theorem gives a general lower bound on this set by leveraging the balanced load function introduced by Hajek (1990). The corresponding obstruction is captured by a new graph parameter, the self-overlap, which measures the extent to which a graph can imitate itself under a non-trivial relabelling. We then show that this criterion is sharp in a broad clas"},"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":"2607.14948","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-07-16T12:57:28Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"ac650f11b1f67fccfdc000c712d47e74abf97493b74c5290ac4f374273e2c0f0","abstract_canon_sha256":"5b5793406049b5b7a6d9609b3c5f89d7bb587acca987e3dedb6401a29831811e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:22:00.567573Z","signature_b64":"mfuTDC696asvYPhH3l3oERpVAEpkp+A6WaV49ep1PhICRDckkJ84D3VYit19ZgY7luPlj3M9jebpDJzTz411Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07019fae2196429dca8ed2f8c042779f9efc1bfdd24ea190758e8555d0de1e18","last_reissued_at":"2026-07-17T01:22:00.566735Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:22:00.566735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph alignment in sparse inhomogeneous models via self-overlap","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Louis Vassaux","submitted_at":"2026-07-16T12:57:28Z","abstract_excerpt":"We develop a general framework for understanding when graph alignment is information-theoretically feasible in sparse inhomogeneous random graph models, by studying the set of vertices on which the underlying matching can be recovered. Our main theorem gives a general lower bound on this set by leveraging the balanced load function introduced by Hajek (1990). The corresponding obstruction is captured by a new graph parameter, the self-overlap, which measures the extent to which a graph can imitate itself under a non-trivial relabelling. We then show that this criterion is sharp in a broad clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14948","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.14948/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":"2607.14948","created_at":"2026-07-17T01:22:00.567173+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.14948v1","created_at":"2026-07-17T01:22:00.567173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14948","created_at":"2026-07-17T01:22:00.567173+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4AZ7LRBSZBJ","created_at":"2026-07-17T01:22:00.567173+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4AZ7LRBSZBJ3SUO","created_at":"2026-07-17T01:22:00.567173+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4AZ7LRB","created_at":"2026-07-17T01:22:00.567173+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6","json":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6.json","graph_json":"https://pith.science/api/pith-number/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/graph.json","events_json":"https://pith.science/api/pith-number/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/events.json","paper":"https://pith.science/paper/A4AZ7LRB"},"agent_actions":{"view_html":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6","download_json":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6.json","view_paper":"https://pith.science/paper/A4AZ7LRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.14948&json=true","fetch_graph":"https://pith.science/api/pith-number/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/graph.json","fetch_events":"https://pith.science/api/pith-number/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/action/storage_attestation","attest_author":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/action/author_attestation","sign_citation":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/action/citation_signature","submit_replication":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/action/replication_record"}},"created_at":"2026-07-17T01:22:00.567173+00:00","updated_at":"2026-07-17T01:22:00.567173+00:00"}