{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6IJ4MCKOVYRCG3LEHM3GVVBREE","short_pith_number":"pith:6IJ4MCKO","schema_version":"1.0","canonical_sha256":"f213c6094eae22236d643b366ad43121146dd870b9fecb97eed6176c1715d6d7","source":{"kind":"arxiv","id":"1809.08496","version":1},"attestation_state":"computed","paper":{"title":"On the relation of separability, bandwidth and embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'alint V\\'as\\'arhelyi, B\\'ela Csaba","submitted_at":"2018-09-22T22:11:17Z","abstract_excerpt":"In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly larger than $n/2$."},"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":"1809.08496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-22T22:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"64bf48d7d98dc06bfaaa175f45fdb44068384e9cd5121677e55d43fb1797d179","abstract_canon_sha256":"77d372423289fee5a717e68351d72f5a1ca533388812a30a4f7f061dec5c2ff4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:04.265767Z","signature_b64":"6ltqmaTLTP5eh7SmxErYxQ+zLLCd2Kt8StFu3H/QUqsJ0HEtJMC4KcYfjQZAkEyckPHEcVMxUpa9fF1UvkrjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f213c6094eae22236d643b366ad43121146dd870b9fecb97eed6176c1715d6d7","last_reissued_at":"2026-05-18T00:05:04.265200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:04.265200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the relation of separability, bandwidth and embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'alint V\\'as\\'arhelyi, B\\'ela Csaba","submitted_at":"2018-09-22T22:11:17Z","abstract_excerpt":"In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly larger than $n/2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08496","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.08496","created_at":"2026-05-18T00:05:04.265284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08496v1","created_at":"2026-05-18T00:05:04.265284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08496","created_at":"2026-05-18T00:05:04.265284+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IJ4MCKOVYRC","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IJ4MCKOVYRCG3LE","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IJ4MCKO","created_at":"2026-05-18T12:32:08.215937+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/6IJ4MCKOVYRCG3LEHM3GVVBREE","json":"https://pith.science/pith/6IJ4MCKOVYRCG3LEHM3GVVBREE.json","graph_json":"https://pith.science/api/pith-number/6IJ4MCKOVYRCG3LEHM3GVVBREE/graph.json","events_json":"https://pith.science/api/pith-number/6IJ4MCKOVYRCG3LEHM3GVVBREE/events.json","paper":"https://pith.science/paper/6IJ4MCKO"},"agent_actions":{"view_html":"https://pith.science/pith/6IJ4MCKOVYRCG3LEHM3GVVBREE","download_json":"https://pith.science/pith/6IJ4MCKOVYRCG3LEHM3GVVBREE.json","view_paper":"https://pith.science/paper/6IJ4MCKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08496&json=true","fetch_graph":"https://pith.science/api/pith-number/6IJ4MCKOVYRCG3LEHM3GVVBREE/graph.json","fetch_events":"https://pith.science/api/pith-number/6IJ4MCKOVYRCG3LEHM3GVVBREE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IJ4MCKOVYRCG3LEHM3GVVBREE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IJ4MCKOVYRCG3LEHM3GVVBREE/action/storage_attestation","attest_author":"https://pith.science/pith/6IJ4MCKOVYRCG3LEHM3GVVBREE/action/author_attestation","sign_citation":"https://pith.science/pith/6IJ4MCKOVYRCG3LEHM3GVVBREE/action/citation_signature","submit_replication":"https://pith.science/pith/6IJ4MCKOVYRCG3LEHM3GVVBREE/action/replication_record"}},"created_at":"2026-05-18T00:05:04.265284+00:00","updated_at":"2026-05-18T00:05:04.265284+00:00"}