{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:A4AZ7LRBSZBJ3SUO2L4MAQTXT6","short_pith_number":"pith:A4AZ7LRB","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"},"canonical_sha256":"07019fae2196429dca8ed2f8c042779f9efc1bfdd24ea190758e8555d0de1e18","source":{"kind":"arxiv","id":"2607.14948","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14948","created_at":"2026-07-17T01:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14948v1","created_at":"2026-07-17T01:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14948","created_at":"2026-07-17T01:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"A4AZ7LRBSZBJ","created_at":"2026-07-17T01:22:00Z"},{"alias_kind":"pith_short_16","alias_value":"A4AZ7LRBSZBJ3SUO","created_at":"2026-07-17T01:22:00Z"},{"alias_kind":"pith_short_8","alias_value":"A4AZ7LRB","created_at":"2026-07-17T01:22:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:A4AZ7LRBSZBJ3SUO2L4MAQTXT6","target":"record","payload":{"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"},"canonical_sha256":"07019fae2196429dca8ed2f8c042779f9efc1bfdd24ea190758e8555d0de1e18","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"},"source_kind":"arxiv","source_id":"2607.14948","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-07-17T01:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhZEkM86kGFerTZI099Swdyb71vUfX2QXAVQHqbpDVRwtWxweiSyLPX2emAwuKjj/Nbr3psVF78dZoRv2dbrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:22:33.057066Z"},"content_sha256":"102222d7b573a8839a9563fb033fca9f1d76797cdce4656b211fabc6fba304b0","schema_version":"1.0","event_id":"sha256:102222d7b573a8839a9563fb033fca9f1d76797cdce4656b211fabc6fba304b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:A4AZ7LRBSZBJ3SUO2L4MAQTXT6","target":"graph","payload":{"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"},"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-17T01:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UjqvzLSKZic2Z2YNxDP10Ba5n0nOlNfNDMqrn5j/BTupJF5+XyWpmQSjrSrQGkDBCwDL0hAQFyWbgMWI2RTsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:22:33.057632Z"},"content_sha256":"9629a6d6a7c382d31d618129aeccac40beb637e8ed03b3576720b98d2b85148e","schema_version":"1.0","event_id":"sha256:9629a6d6a7c382d31d618129aeccac40beb637e8ed03b3576720b98d2b85148e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/bundle.json","state_url":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/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-05T23:22:33Z","links":{"resolver":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6","bundle":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/bundle.json","state":"https://pith.science/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4AZ7LRBSZBJ3SUO2L4MAQTXT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:A4AZ7LRBSZBJ3SUO2L4MAQTXT6","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":"5b5793406049b5b7a6d9609b3c5f89d7bb587acca987e3dedb6401a29831811e","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-07-16T12:57:28Z","title_canon_sha256":"ac650f11b1f67fccfdc000c712d47e74abf97493b74c5290ac4f374273e2c0f0"},"schema_version":"1.0","source":{"id":"2607.14948","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14948","created_at":"2026-07-17T01:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14948v1","created_at":"2026-07-17T01:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14948","created_at":"2026-07-17T01:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"A4AZ7LRBSZBJ","created_at":"2026-07-17T01:22:00Z"},{"alias_kind":"pith_short_16","alias_value":"A4AZ7LRBSZBJ3SUO","created_at":"2026-07-17T01:22:00Z"},{"alias_kind":"pith_short_8","alias_value":"A4AZ7LRB","created_at":"2026-07-17T01:22:00Z"}],"graph_snapshots":[{"event_id":"sha256:9629a6d6a7c382d31d618129aeccac40beb637e8ed03b3576720b98d2b85148e","target":"graph","created_at":"2026-07-17T01:22:00Z","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/2607.14948/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Louis Vassaux","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-07-16T12:57:28Z","title":"Graph alignment in sparse inhomogeneous models via self-overlap"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14948","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:102222d7b573a8839a9563fb033fca9f1d76797cdce4656b211fabc6fba304b0","target":"record","created_at":"2026-07-17T01:22:00Z","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":"5b5793406049b5b7a6d9609b3c5f89d7bb587acca987e3dedb6401a29831811e","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-07-16T12:57:28Z","title_canon_sha256":"ac650f11b1f67fccfdc000c712d47e74abf97493b74c5290ac4f374273e2c0f0"},"schema_version":"1.0","source":{"id":"2607.14948","kind":"arxiv","version":1}},"canonical_sha256":"07019fae2196429dca8ed2f8c042779f9efc1bfdd24ea190758e8555d0de1e18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07019fae2196429dca8ed2f8c042779f9efc1bfdd24ea190758e8555d0de1e18","first_computed_at":"2026-07-17T01:22:00.566735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-17T01:22:00.566735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mfuTDC696asvYPhH3l3oERpVAEpkp+A6WaV49ep1PhICRDckkJ84D3VYit19ZgY7luPlj3M9jebpDJzTz411Dw==","signature_status":"signed_v1","signed_at":"2026-07-17T01:22:00.567573Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.14948","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:102222d7b573a8839a9563fb033fca9f1d76797cdce4656b211fabc6fba304b0","sha256:9629a6d6a7c382d31d618129aeccac40beb637e8ed03b3576720b98d2b85148e"],"state_sha256":"a8b7a26645a5793a11f22647019486453509fcdc56c58ab1e5fa25b4d1e706d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I72oDUArm7WWsQy423GLSuuMVRmuYlMG3fsPRloW445PqkzkbNX2eQznajaFahsUhJARMvdB7AD91FmEc5M2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T23:22:33.064541Z","bundle_sha256":"c237fe1146150e1d0618e553cfd8aa991d1665c9ad93dcae2678d9981a7ac31e"}}