{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CEYL55VQMS2VHR4WU4EHKTWDPI","short_pith_number":"pith:CEYL55VQ","schema_version":"1.0","canonical_sha256":"1130bef6b064b553c796a708754ec37a389bfbce14dccd9c3760a908684f9765","source":{"kind":"arxiv","id":"2505.06329","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.06329","created_at":"2026-07-05T11:01:07.556481+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.06329v1","created_at":"2026-07-05T11:01:07.556481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06329","created_at":"2026-07-05T11:01:07.556481+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEYL55VQMS2V","created_at":"2026-07-05T11:01:07.556481+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEYL55VQMS2VHR4W","created_at":"2026-07-05T11:01:07.556481+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEYL55VQ","created_at":"2026-07-05T11:01:07.556481+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/CEYL55VQMS2VHR4WU4EHKTWDPI","json":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI.json","graph_json":"https://pith.science/api/pith-number/CEYL55VQMS2VHR4WU4EHKTWDPI/graph.json","events_json":"https://pith.science/api/pith-number/CEYL55VQMS2VHR4WU4EHKTWDPI/events.json","paper":"https://pith.science/paper/CEYL55VQ"},"agent_actions":{"view_html":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI","download_json":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI.json","view_paper":"https://pith.science/paper/CEYL55VQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.06329&json=true","fetch_graph":"https://pith.science/api/pith-number/CEYL55VQMS2VHR4WU4EHKTWDPI/graph.json","fetch_events":"https://pith.science/api/pith-number/CEYL55VQMS2VHR4WU4EHKTWDPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI/action/storage_attestation","attest_author":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI/action/author_attestation","sign_citation":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI/action/citation_signature","submit_replication":"https://pith.science/pith/CEYL55VQMS2VHR4WU4EHKTWDPI/action/replication_record"}},"created_at":"2026-07-05T11:01:07.556481+00:00","updated_at":"2026-07-05T11:01:07.556481+00:00"}