{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MKGOMKKKBK2BCARJUVSZVCRTSQ","short_pith_number":"pith:MKGOMKKK","schema_version":"1.0","canonical_sha256":"628ce6294a0ab4110229a5659a8a3394163d0326c430a65f12ee49ba6aa08e97","source":{"kind":"arxiv","id":"1501.05020","version":3},"attestation_state":"computed","paper":{"title":"Layouts of Expander Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Anastasios Sidiropoulos, David R. Wood, Vida Dujmovi\\'c","submitted_at":"2015-01-20T23:33:56Z","abstract_excerpt":"Bourgain and Yehudayoff recently constructed $O(1)$-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple thickness 2. All these results are best possible."},"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":"1501.05020","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-20T23:33:56Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"b52258d9cdbbc6b3a744149518e15e28da58e533237fad884b1d37788523be06","abstract_canon_sha256":"61eb24df3d02b1eafea0dcecf4b7ce7d58bc194b3049573a31084aaf8a044514"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:13.575077Z","signature_b64":"Xh3xzVxIH9ergFiUf+GnyIMZ4fhLiH6/Xg9c9GvwhW7hFUoGRqPkDKFbIqxVfcZwyh5K9TgMOvZwOZ3s0ENIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"628ce6294a0ab4110229a5659a8a3394163d0326c430a65f12ee49ba6aa08e97","last_reissued_at":"2026-05-18T01:21:13.574577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:13.574577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layouts of Expander Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Anastasios Sidiropoulos, David R. Wood, Vida Dujmovi\\'c","submitted_at":"2015-01-20T23:33:56Z","abstract_excerpt":"Bourgain and Yehudayoff recently constructed $O(1)$-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple thickness 2. All these results are best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05020","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.05020","created_at":"2026-05-18T01:21:13.574659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05020v3","created_at":"2026-05-18T01:21:13.574659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05020","created_at":"2026-05-18T01:21:13.574659+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKGOMKKKBK2B","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKGOMKKKBK2BCARJ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKGOMKKK","created_at":"2026-05-18T12:29:32.376354+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/MKGOMKKKBK2BCARJUVSZVCRTSQ","json":"https://pith.science/pith/MKGOMKKKBK2BCARJUVSZVCRTSQ.json","graph_json":"https://pith.science/api/pith-number/MKGOMKKKBK2BCARJUVSZVCRTSQ/graph.json","events_json":"https://pith.science/api/pith-number/MKGOMKKKBK2BCARJUVSZVCRTSQ/events.json","paper":"https://pith.science/paper/MKGOMKKK"},"agent_actions":{"view_html":"https://pith.science/pith/MKGOMKKKBK2BCARJUVSZVCRTSQ","download_json":"https://pith.science/pith/MKGOMKKKBK2BCARJUVSZVCRTSQ.json","view_paper":"https://pith.science/paper/MKGOMKKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05020&json=true","fetch_graph":"https://pith.science/api/pith-number/MKGOMKKKBK2BCARJUVSZVCRTSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MKGOMKKKBK2BCARJUVSZVCRTSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKGOMKKKBK2BCARJUVSZVCRTSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKGOMKKKBK2BCARJUVSZVCRTSQ/action/storage_attestation","attest_author":"https://pith.science/pith/MKGOMKKKBK2BCARJUVSZVCRTSQ/action/author_attestation","sign_citation":"https://pith.science/pith/MKGOMKKKBK2BCARJUVSZVCRTSQ/action/citation_signature","submit_replication":"https://pith.science/pith/MKGOMKKKBK2BCARJUVSZVCRTSQ/action/replication_record"}},"created_at":"2026-05-18T01:21:13.574659+00:00","updated_at":"2026-05-18T01:21:13.574659+00:00"}