{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CSBXI556BJUBLUEJLC5N4Y362E","short_pith_number":"pith:CSBXI556","canonical_record":{"source":{"id":"1802.00918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-03T05:51:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"332c74534e525eb31e51fb2093eff7a244483ac999417f87d685f7ee449afea5","abstract_canon_sha256":"ba9c8e1f30e6ada4151f5b2eebd2817e257cf7b59737778a0602eadac32b7134"},"schema_version":"1.0"},"canonical_sha256":"14837477be0a6815d08958bade637ed13f2403792960d7258349916806d3bf46","source":{"kind":"arxiv","id":"1802.00918","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00918","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00918v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00918","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"CSBXI556BJUB","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CSBXI556BJUBLUEJ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CSBXI556","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CSBXI556BJUBLUEJLC5N4Y362E","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-03T05:51:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"332c74534e525eb31e51fb2093eff7a244483ac999417f87d685f7ee449afea5","abstract_canon_sha256":"ba9c8e1f30e6ada4151f5b2eebd2817e257cf7b59737778a0602eadac32b7134"},"schema_version":"1.0"},"canonical_sha256":"14837477be0a6815d08958bade637ed13f2403792960d7258349916806d3bf46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:27.903617Z","signature_b64":"wpVm2cOnaeu1lAg0U9O5aEsPhRjHi7RCxAu3URUu9ZELh8xRltxvYMHt1quBgCGls6iJyecNMm5cE6V7LXG3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14837477be0a6815d08958bade637ed13f2403792960d7258349916806d3bf46","last_reissued_at":"2026-05-18T00:24:27.903020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:27.903020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00918","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-05-18T00:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKPZV4BPJPD2ZvzaUs863F4p7sDNp/Fdi7k6EVE1x3RJz5bjX+4gisNpy3lQdrDl9BQc+N/gvueCPM1E7UVgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:00:36.941978Z"},"content_sha256":"18f810bd369022d803a909201104ed909f8a9af8faa78e7a70cfa882afaeed2e","schema_version":"1.0","event_id":"sha256:18f810bd369022d803a909201104ed909f8a9af8faa78e7a70cfa882afaeed2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CSBXI556BJUBLUEJLC5N4Y362E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Typicality Matching for Pairs of Correlated Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"E. Erkip, F. Shirani, S. Garg","submitted_at":"2018-02-03T05:51:32Z","abstract_excerpt":"In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network de-anonymization, study of biological data, web graphs, etc. An achievable region for successful matching is derived by analyzing a new matching algorithm that we refer to as typicality matching. The algorithm operates by investigating the joint typicality of the adjacency matrices of the two correlated graphs. Our main result shows that the achievable region depe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00918","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":""},"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-05-18T00:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4d+H64moBQh6w3R5PqQhhguKSRGVPvfC2HlOivUMRvJm02xkCsrgfKyhdN6kmjWpveSYCYPlwAh/13qXvIitAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:00:36.942693Z"},"content_sha256":"750f69ba0a2a4be66fd1a86c2849a6c1a224d36702c0357e53a267b2a0bc7e3e","schema_version":"1.0","event_id":"sha256:750f69ba0a2a4be66fd1a86c2849a6c1a224d36702c0357e53a267b2a0bc7e3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSBXI556BJUBLUEJLC5N4Y362E/bundle.json","state_url":"https://pith.science/pith/CSBXI556BJUBLUEJLC5N4Y362E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSBXI556BJUBLUEJLC5N4Y362E/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-05-25T19:00:36Z","links":{"resolver":"https://pith.science/pith/CSBXI556BJUBLUEJLC5N4Y362E","bundle":"https://pith.science/pith/CSBXI556BJUBLUEJLC5N4Y362E/bundle.json","state":"https://pith.science/pith/CSBXI556BJUBLUEJLC5N4Y362E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSBXI556BJUBLUEJLC5N4Y362E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CSBXI556BJUBLUEJLC5N4Y362E","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":"ba9c8e1f30e6ada4151f5b2eebd2817e257cf7b59737778a0602eadac32b7134","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-03T05:51:32Z","title_canon_sha256":"332c74534e525eb31e51fb2093eff7a244483ac999417f87d685f7ee449afea5"},"schema_version":"1.0","source":{"id":"1802.00918","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00918","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00918v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00918","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"CSBXI556BJUB","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CSBXI556BJUBLUEJ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CSBXI556","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:750f69ba0a2a4be66fd1a86c2849a6c1a224d36702c0357e53a267b2a0bc7e3e","target":"graph","created_at":"2026-05-18T00:24:27Z","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"},"paper":{"abstract_excerpt":"In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network de-anonymization, study of biological data, web graphs, etc. An achievable region for successful matching is derived by analyzing a new matching algorithm that we refer to as typicality matching. The algorithm operates by investigating the joint typicality of the adjacency matrices of the two correlated graphs. Our main result shows that the achievable region depe","authors_text":"E. Erkip, F. Shirani, S. Garg","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-03T05:51:32Z","title":"Typicality Matching for Pairs of Correlated Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00918","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:18f810bd369022d803a909201104ed909f8a9af8faa78e7a70cfa882afaeed2e","target":"record","created_at":"2026-05-18T00:24:27Z","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":"ba9c8e1f30e6ada4151f5b2eebd2817e257cf7b59737778a0602eadac32b7134","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-03T05:51:32Z","title_canon_sha256":"332c74534e525eb31e51fb2093eff7a244483ac999417f87d685f7ee449afea5"},"schema_version":"1.0","source":{"id":"1802.00918","kind":"arxiv","version":1}},"canonical_sha256":"14837477be0a6815d08958bade637ed13f2403792960d7258349916806d3bf46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14837477be0a6815d08958bade637ed13f2403792960d7258349916806d3bf46","first_computed_at":"2026-05-18T00:24:27.903020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:27.903020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wpVm2cOnaeu1lAg0U9O5aEsPhRjHi7RCxAu3URUu9ZELh8xRltxvYMHt1quBgCGls6iJyecNMm5cE6V7LXG3AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:27.903617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00918","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18f810bd369022d803a909201104ed909f8a9af8faa78e7a70cfa882afaeed2e","sha256:750f69ba0a2a4be66fd1a86c2849a6c1a224d36702c0357e53a267b2a0bc7e3e"],"state_sha256":"75baffff232a3805e88ee7e52117b07decead3e8aec284f7fc86cb95ea312662"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLwc5h61FTiRIwydjCIs49D/qMYrl45r7FLtZpjKyOvZOeydLOvEy2E2QJEPWRLXKJQxvJhQVgw9H/MVcI2cDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:00:36.946539Z","bundle_sha256":"2accd8438ebd5ddcaf6ee89ed4cb365343868b8445f0b9281469770c099b0c63"}}