{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PDKGJHNYCWIO6SUPQB4NUVWFLD","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":"657e4ebfd32a5b687799a3a937739ea24732ad0b59ac597aeb8f444a2968b476","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-08T16:48:36Z","title_canon_sha256":"314021eac81394d53a71873d94b41a13f259e8d96f9b66e3452c6c4ae1ae1c38"},"schema_version":"1.0","source":{"id":"2301.03072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.03072","created_at":"2026-07-05T05:31:25Z"},{"alias_kind":"arxiv_version","alias_value":"2301.03072v1","created_at":"2026-07-05T05:31:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03072","created_at":"2026-07-05T05:31:25Z"},{"alias_kind":"pith_short_12","alias_value":"PDKGJHNYCWIO","created_at":"2026-07-05T05:31:25Z"},{"alias_kind":"pith_short_16","alias_value":"PDKGJHNYCWIO6SUP","created_at":"2026-07-05T05:31:25Z"},{"alias_kind":"pith_short_8","alias_value":"PDKGJHNY","created_at":"2026-07-05T05:31:25Z"}],"graph_snapshots":[{"event_id":"sha256:334799f90e7c86c2f966a79cf6ec674644b3d8a717c951b1e1984b90ebb61d48","target":"graph","created_at":"2026-07-05T05:31:25Z","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/2301.03072/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We construct an infinite family of bounded-degree bipartite unique-neighbour expander graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders constructed by Capalbo et al., our construction is simpler and may be closer to be implementable in practice due to the smaller constants. We construct these graphs by composing bipartite Ramanujan graphs with a fixed-size gadget in a way that generalizes the construction of unique neighbour expanders by Alon and Capalbo. For the analysis of our construction we prove a strong upper bound on average degrees in small induced s","authors_text":"Irit Dinur, Ron Asherov","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-08T16:48:36Z","title":"Bipartite unique-neighbour expanders via Ramanujan graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03072","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:39e270f962dadc7e44e473a686978fd54957370e03fdeb85655013560e1bfb9d","target":"record","created_at":"2026-07-05T05:31:25Z","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":"657e4ebfd32a5b687799a3a937739ea24732ad0b59ac597aeb8f444a2968b476","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-08T16:48:36Z","title_canon_sha256":"314021eac81394d53a71873d94b41a13f259e8d96f9b66e3452c6c4ae1ae1c38"},"schema_version":"1.0","source":{"id":"2301.03072","kind":"arxiv","version":1}},"canonical_sha256":"78d4649db81590ef4a8f8078da56c558ec54dac3e342c57764acde3c27f62f7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78d4649db81590ef4a8f8078da56c558ec54dac3e342c57764acde3c27f62f7e","first_computed_at":"2026-07-05T05:31:25.437172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:31:25.437172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iod4Awk5XLdAtfjqOPI9fPVXtWN91mLGoUUS8DdGNOLOYrfVrrm/mvsY13HRCIRXIbhykQop5eFdzmrMSGsiBg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:31:25.437646Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.03072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39e270f962dadc7e44e473a686978fd54957370e03fdeb85655013560e1bfb9d","sha256:334799f90e7c86c2f966a79cf6ec674644b3d8a717c951b1e1984b90ebb61d48"],"state_sha256":"1e59157e408f66c88743f1f5bf238d28bfea811dd0beb9a098c10d46bc871c6c"}