{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CEYL55VQMS2VHR4WU4EHKTWDPI","short_pith_number":"pith:CEYL55VQ","canonical_record":{"source":{"id":"2505.06329","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-09T14:21:54Z","cross_cats_sorted":[],"title_canon_sha256":"0f479513b4ff8f86b1b9a129385a62b89385d566518132af797eaa399846b56e","abstract_canon_sha256":"144fee941747cdc5ff290e42a2596debb736779c88c1a2a25521e0eb9418f593"},"schema_version":"1.0"},"canonical_sha256":"1130bef6b064b553c796a708754ec37a389bfbce14dccd9c3760a908684f9765","source":{"kind":"arxiv","id":"2505.06329","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.06329","created_at":"2026-07-05T11:01:07Z"},{"alias_kind":"arxiv_version","alias_value":"2505.06329v1","created_at":"2026-07-05T11:01:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06329","created_at":"2026-07-05T11:01:07Z"},{"alias_kind":"pith_short_12","alias_value":"CEYL55VQMS2V","created_at":"2026-07-05T11:01:07Z"},{"alias_kind":"pith_short_16","alias_value":"CEYL55VQMS2VHR4W","created_at":"2026-07-05T11:01:07Z"},{"alias_kind":"pith_short_8","alias_value":"CEYL55VQ","created_at":"2026-07-05T11:01:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CEYL55VQMS2VHR4WU4EHKTWDPI","target":"record","payload":{"canonical_record":{"source":{"id":"2505.06329","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-09T14:21:54Z","cross_cats_sorted":[],"title_canon_sha256":"0f479513b4ff8f86b1b9a129385a62b89385d566518132af797eaa399846b56e","abstract_canon_sha256":"144fee941747cdc5ff290e42a2596debb736779c88c1a2a25521e0eb9418f593"},"schema_version":"1.0"},"canonical_sha256":"1130bef6b064b553c796a708754ec37a389bfbce14dccd9c3760a908684f9765","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:07.556912Z","signature_b64":"Ot5wvtMG578pMMDXqAZzvVzWXnRIbvtbIOI18nHnVPqjt1pgVCGgf+0yZj/cD4dK4lMmDxQqoUhGq3svOENBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1130bef6b064b553c796a708754ec37a389bfbce14dccd9c3760a908684f9765","last_reissued_at":"2026-07-05T11:01:07.556416Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:07.556416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.06329","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-05T11:01:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHKVXsPsmTsFIL/yCLUP4mVM17SO7PfV1zjFPDYY89KvCN3gp8JjvrpNKb5YpXFdfBArPddQXmmJFijMU2XfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:06:52.289389Z"},"content_sha256":"0aa7e707fa83f83e04e84fb201767852ba7f9cc9067981b34124cb10eeece798","schema_version":"1.0","event_id":"sha256:0aa7e707fa83f83e04e84fb201767852ba7f9cc9067981b34124cb10eeece798"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CEYL55VQMS2VHR4WU4EHKTWDPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Unique Neighborhoods in Bipartite and Expander Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Stefan Rass","submitted_at":"2025-05-09T14:21:54Z","abstract_excerpt":"An undirected graph is said to have \\emph{unique neighborhoods} if any two distinct nodes have also distinct sets of neighbors. In this way, the connections of a node to other nodes can characterize a node like an \"identity\", irrespectively of how nodes are named, as long as two nodes are distinguishable. We study the uniqueness of neighborhoods in (random) bipartite graphs, and expander graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.06329","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/2505.06329/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-05T11:01:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bX+hcrOLc4zQ/WpO8XhHc9z0LYbVvfjSAey6DLyy4vXhdIx7tSR7V4+71Gejn/0zXz/0Nky1IDwFn7CqMeAUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:06:52.290108Z"},"content_sha256":"a4822029c273b209b715ab6c5511fbeacf92b842013e1b034de48e0b372d7029","schema_version":"1.0","event_id":"sha256:a4822029c273b209b715ab6c5511fbeacf92b842013e1b034de48e0b372d7029"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI/bundle.json","state_url":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEYL55VQMS2VHR4WU4EHKTWDPI/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-04T21:06:52Z","links":{"resolver":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI","bundle":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI/bundle.json","state":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEYL55VQMS2VHR4WU4EHKTWDPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CEYL55VQMS2VHR4WU4EHKTWDPI","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":"144fee941747cdc5ff290e42a2596debb736779c88c1a2a25521e0eb9418f593","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-09T14:21:54Z","title_canon_sha256":"0f479513b4ff8f86b1b9a129385a62b89385d566518132af797eaa399846b56e"},"schema_version":"1.0","source":{"id":"2505.06329","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.06329","created_at":"2026-07-05T11:01:07Z"},{"alias_kind":"arxiv_version","alias_value":"2505.06329v1","created_at":"2026-07-05T11:01:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06329","created_at":"2026-07-05T11:01:07Z"},{"alias_kind":"pith_short_12","alias_value":"CEYL55VQMS2V","created_at":"2026-07-05T11:01:07Z"},{"alias_kind":"pith_short_16","alias_value":"CEYL55VQMS2VHR4W","created_at":"2026-07-05T11:01:07Z"},{"alias_kind":"pith_short_8","alias_value":"CEYL55VQ","created_at":"2026-07-05T11:01:07Z"}],"graph_snapshots":[{"event_id":"sha256:a4822029c273b209b715ab6c5511fbeacf92b842013e1b034de48e0b372d7029","target":"graph","created_at":"2026-07-05T11:01:07Z","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/2505.06329/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An undirected graph is said to have \\emph{unique neighborhoods} if any two distinct nodes have also distinct sets of neighbors. In this way, the connections of a node to other nodes can characterize a node like an \"identity\", irrespectively of how nodes are named, as long as two nodes are distinguishable. We study the uniqueness of neighborhoods in (random) bipartite graphs, and expander graphs.","authors_text":"Stefan Rass","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-09T14:21:54Z","title":"On Unique Neighborhoods in Bipartite and Expander Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.06329","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:0aa7e707fa83f83e04e84fb201767852ba7f9cc9067981b34124cb10eeece798","target":"record","created_at":"2026-07-05T11:01:07Z","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":"144fee941747cdc5ff290e42a2596debb736779c88c1a2a25521e0eb9418f593","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-09T14:21:54Z","title_canon_sha256":"0f479513b4ff8f86b1b9a129385a62b89385d566518132af797eaa399846b56e"},"schema_version":"1.0","source":{"id":"2505.06329","kind":"arxiv","version":1}},"canonical_sha256":"1130bef6b064b553c796a708754ec37a389bfbce14dccd9c3760a908684f9765","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1130bef6b064b553c796a708754ec37a389bfbce14dccd9c3760a908684f9765","first_computed_at":"2026-07-05T11:01:07.556416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:01:07.556416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ot5wvtMG578pMMDXqAZzvVzWXnRIbvtbIOI18nHnVPqjt1pgVCGgf+0yZj/cD4dK4lMmDxQqoUhGq3svOENBAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:01:07.556912Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.06329","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0aa7e707fa83f83e04e84fb201767852ba7f9cc9067981b34124cb10eeece798","sha256:a4822029c273b209b715ab6c5511fbeacf92b842013e1b034de48e0b372d7029"],"state_sha256":"bd50c1170eafa2e3854e1a53178e9db495fae7289b33d03be43fe422c3f2a488"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYg6etWWVHlQAkB9RJHQw3MOoXII99OnrttUTTEtD626mRBE3JpboBbM89wtv0U/XI8ZUd6F9R144v+EpsA1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:06:52.295588Z","bundle_sha256":"993f0d98579e4300ebc67150abc08e60abfd9286f1f98b8d5a59ce7d70e3200d"}}