{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RQJ3NVAPXHPTSAHGQZHWSCA7FW","short_pith_number":"pith:RQJ3NVAP","canonical_record":{"source":{"id":"1810.13347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-31T15:36:50Z","cross_cats_sorted":["cs.SI","q-bio.QM"],"title_canon_sha256":"02ae89aa9e7374c4432db9b3f53d91cd7bd4f4d75245772fc4f438579a2f284c","abstract_canon_sha256":"2fac0af9a3f4c7bf171104c0fba08cbca00c48d3bc0bbef4e4dcbbea1720c3bd"},"schema_version":"1.0"},"canonical_sha256":"8c13b6d40fb9df3900e6864f69081f2d8b09f9d25158e48ec910708c177b111b","source":{"kind":"arxiv","id":"1810.13347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13347","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13347v1","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13347","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"RQJ3NVAPXHPT","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RQJ3NVAPXHPTSAHG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RQJ3NVAP","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RQJ3NVAPXHPTSAHGQZHWSCA7FW","target":"record","payload":{"canonical_record":{"source":{"id":"1810.13347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-31T15:36:50Z","cross_cats_sorted":["cs.SI","q-bio.QM"],"title_canon_sha256":"02ae89aa9e7374c4432db9b3f53d91cd7bd4f4d75245772fc4f438579a2f284c","abstract_canon_sha256":"2fac0af9a3f4c7bf171104c0fba08cbca00c48d3bc0bbef4e4dcbbea1720c3bd"},"schema_version":"1.0"},"canonical_sha256":"8c13b6d40fb9df3900e6864f69081f2d8b09f9d25158e48ec910708c177b111b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:49.601026Z","signature_b64":"Pdd/ipzTONVPXCgE6MGHBLk54NfjxFXJFmjqrtIN8j7/xbBQ/8j/j0JyUP/Cu/uWtzbLcBJHuBh+GdIIofZeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c13b6d40fb9df3900e6864f69081f2d8b09f9d25158e48ec910708c177b111b","last_reissued_at":"2026-05-18T00:01:49.600432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:49.600432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.13347","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:01:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6u394EO6Wfm5EbnLk+sMeRthG4Tz88oKoH3guBGPa1jlkiLHvjSdXmW589vrNOoom8RUoQvJ9vlE0fHUTtW5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:09:18.868483Z"},"content_sha256":"a41db1988888a1cd3dd62925b49f3be0b8cd9a76832fb466a6f18d15f6e67bfb","schema_version":"1.0","event_id":"sha256:a41db1988888a1cd3dd62925b49f3be0b8cd9a76832fb466a6f18d15f6e67bfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RQJ3NVAPXHPTSAHGQZHWSCA7FW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matching Graphs with Community Structure: A Concentration of Measure Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","q-bio.QM"],"primary_cat":"cs.CR","authors_text":"E. Erkip, F. Shirani, S. Garg","submitted_at":"2018-10-31T15:36:50Z","abstract_excerpt":"In this paper, matching pairs of random graphs under the community structure model is considered. The problem emerges naturally in various applications such as privacy, image processing and DNA sequencing. A pair of randomly generated labeled graphs with pairwise correlated edges are considered. It is assumed that the graph edges are generated based on the community structure model. Given the labeling of the edges of the first graph, the objective is to recover the labels in the second graph. The problem is considered under two scenarios: i) with side-information where the community membership"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13347","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:01:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H8oLz392IvMYbddO3kEr/QwdRk4e65ayctQ8Ou1lPFHLu+JvfaW8mAzBjcu+f8ToNPVvxs1mj7+kE4e9FLokBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:09:18.869176Z"},"content_sha256":"2aaa954466ef122252314e5e122319932a66ba2f665afe8fa6b9659cb1955fce","schema_version":"1.0","event_id":"sha256:2aaa954466ef122252314e5e122319932a66ba2f665afe8fa6b9659cb1955fce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQJ3NVAPXHPTSAHGQZHWSCA7FW/bundle.json","state_url":"https://pith.science/pith/RQJ3NVAPXHPTSAHGQZHWSCA7FW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQJ3NVAPXHPTSAHGQZHWSCA7FW/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-25T15:09:18Z","links":{"resolver":"https://pith.science/pith/RQJ3NVAPXHPTSAHGQZHWSCA7FW","bundle":"https://pith.science/pith/RQJ3NVAPXHPTSAHGQZHWSCA7FW/bundle.json","state":"https://pith.science/pith/RQJ3NVAPXHPTSAHGQZHWSCA7FW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQJ3NVAPXHPTSAHGQZHWSCA7FW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RQJ3NVAPXHPTSAHGQZHWSCA7FW","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":"2fac0af9a3f4c7bf171104c0fba08cbca00c48d3bc0bbef4e4dcbbea1720c3bd","cross_cats_sorted":["cs.SI","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-31T15:36:50Z","title_canon_sha256":"02ae89aa9e7374c4432db9b3f53d91cd7bd4f4d75245772fc4f438579a2f284c"},"schema_version":"1.0","source":{"id":"1810.13347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13347","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13347v1","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13347","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"RQJ3NVAPXHPT","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RQJ3NVAPXHPTSAHG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RQJ3NVAP","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:2aaa954466ef122252314e5e122319932a66ba2f665afe8fa6b9659cb1955fce","target":"graph","created_at":"2026-05-18T00:01:49Z","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, matching pairs of random graphs under the community structure model is considered. The problem emerges naturally in various applications such as privacy, image processing and DNA sequencing. A pair of randomly generated labeled graphs with pairwise correlated edges are considered. It is assumed that the graph edges are generated based on the community structure model. Given the labeling of the edges of the first graph, the objective is to recover the labels in the second graph. The problem is considered under two scenarios: i) with side-information where the community membership","authors_text":"E. Erkip, F. Shirani, S. Garg","cross_cats":["cs.SI","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-31T15:36:50Z","title":"Matching Graphs with Community Structure: A Concentration of Measure Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13347","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:a41db1988888a1cd3dd62925b49f3be0b8cd9a76832fb466a6f18d15f6e67bfb","target":"record","created_at":"2026-05-18T00:01:49Z","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":"2fac0af9a3f4c7bf171104c0fba08cbca00c48d3bc0bbef4e4dcbbea1720c3bd","cross_cats_sorted":["cs.SI","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-31T15:36:50Z","title_canon_sha256":"02ae89aa9e7374c4432db9b3f53d91cd7bd4f4d75245772fc4f438579a2f284c"},"schema_version":"1.0","source":{"id":"1810.13347","kind":"arxiv","version":1}},"canonical_sha256":"8c13b6d40fb9df3900e6864f69081f2d8b09f9d25158e48ec910708c177b111b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c13b6d40fb9df3900e6864f69081f2d8b09f9d25158e48ec910708c177b111b","first_computed_at":"2026-05-18T00:01:49.600432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:49.600432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pdd/ipzTONVPXCgE6MGHBLk54NfjxFXJFmjqrtIN8j7/xbBQ/8j/j0JyUP/Cu/uWtzbLcBJHuBh+GdIIofZeAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:49.601026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a41db1988888a1cd3dd62925b49f3be0b8cd9a76832fb466a6f18d15f6e67bfb","sha256:2aaa954466ef122252314e5e122319932a66ba2f665afe8fa6b9659cb1955fce"],"state_sha256":"689974691d2a1419942970d1902b54352d51b10f832ab3427a16114745286a32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mVpWahDe4PaRhTgqikzzNdFyxggV3x8RBMBHVhZU2tDdWhNJJ+6XO1iiTwlfco9KNVfVRsaNLI1/L4qGB+JfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:09:18.872677Z","bundle_sha256":"2d4f351294d98ab6cd6e1c7bb782f77faf71d1522a82fa93a3e3d0dbf9e741c0"}}