{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DTM7XDXZGKZSJI2SVV5PYBBYOH","short_pith_number":"pith:DTM7XDXZ","canonical_record":{"source":{"id":"2505.10789","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-16T02:03:04Z","cross_cats_sorted":[],"title_canon_sha256":"1d931138a7f32a748ae7cbd52859379c0ca39d4dbcb67f2a148cd3e0e23219da","abstract_canon_sha256":"1008062406382dd2f072427285aeb44fff546e51e4e31bec28c51c5b4edcb4ba"},"schema_version":"1.0"},"canonical_sha256":"1cd9fb8ef932b324a352ad7afc043871da41643383da3eac1b58ec7bd49a0d3a","source":{"kind":"arxiv","id":"2505.10789","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.10789","created_at":"2026-07-05T11:34:08Z"},{"alias_kind":"arxiv_version","alias_value":"2505.10789v3","created_at":"2026-07-05T11:34:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10789","created_at":"2026-07-05T11:34:08Z"},{"alias_kind":"pith_short_12","alias_value":"DTM7XDXZGKZS","created_at":"2026-07-05T11:34:08Z"},{"alias_kind":"pith_short_16","alias_value":"DTM7XDXZGKZSJI2S","created_at":"2026-07-05T11:34:08Z"},{"alias_kind":"pith_short_8","alias_value":"DTM7XDXZ","created_at":"2026-07-05T11:34:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DTM7XDXZGKZSJI2SVV5PYBBYOH","target":"record","payload":{"canonical_record":{"source":{"id":"2505.10789","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-16T02:03:04Z","cross_cats_sorted":[],"title_canon_sha256":"1d931138a7f32a748ae7cbd52859379c0ca39d4dbcb67f2a148cd3e0e23219da","abstract_canon_sha256":"1008062406382dd2f072427285aeb44fff546e51e4e31bec28c51c5b4edcb4ba"},"schema_version":"1.0"},"canonical_sha256":"1cd9fb8ef932b324a352ad7afc043871da41643383da3eac1b58ec7bd49a0d3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:08.334967Z","signature_b64":"pmxC9ipcpofS05rXwTuhlk49gRpBZvfXuiID1ruykukV4bSOfp0lOQ4Xhhrj5x+hI28HTj55BHDj62c7DWnlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cd9fb8ef932b324a352ad7afc043871da41643383da3eac1b58ec7bd49a0d3a","last_reissued_at":"2026-07-05T11:34:08.334419Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:08.334419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.10789","source_version":3,"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:34:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VspatqxVnqwb7TncxMLywFz3lVHvBHbd2btkYeBjTcYFYmVj4133j4KEmwaGNduRhaSvLlgZBOG0aqrhDurADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:13:33.602502Z"},"content_sha256":"6ab1b3f9770e2562b232a04b450609c3738717523181ebe30c643486c0679d7a","schema_version":"1.0","event_id":"sha256:6ab1b3f9770e2562b232a04b450609c3738717523181ebe30c643486c0679d7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DTM7XDXZGKZSJI2SVV5PYBBYOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Eppstein, Michael T. Goodrich, Songyu Liu","submitted_at":"2025-05-16T02:03:04Z","abstract_excerpt":"We provide the first approximation quality guarantees for the Cuthull-McKee heuristic for reordering symmetric matrices to have low bandwidth, and we provide an algorithm for reconstructing bounded-bandwidth graphs from distance oracles with near-linear query complexity. To prove these results we introduce a new width parameter, BFS width, and we prove polylogarithmic upper and lower bounds on the BFS width of graphs of bounded bandwidth. Unlike other width parameters, such as bandwidth, pathwidth, and treewidth, BFS width can easily be computed in polynomial time. Bounded BFS width implies bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10789","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.10789/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:34:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovoDwefA8ZD1JWBYQmewRvTireOO7aiH7wkCLkz2fJlQHFVm2O9Qweo2yTUWF1L3hNIevqaKOFoEoquEuqYhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:13:33.603467Z"},"content_sha256":"f8f450743df8dd1e9ecd4ad1c3c967ce2df0b18a2e5e100d0a83e69ed9eaf4e0","schema_version":"1.0","event_id":"sha256:f8f450743df8dd1e9ecd4ad1c3c967ce2df0b18a2e5e100d0a83e69ed9eaf4e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTM7XDXZGKZSJI2SVV5PYBBYOH/bundle.json","state_url":"https://pith.science/pith/DTM7XDXZGKZSJI2SVV5PYBBYOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTM7XDXZGKZSJI2SVV5PYBBYOH/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-20T04:13:33Z","links":{"resolver":"https://pith.science/pith/DTM7XDXZGKZSJI2SVV5PYBBYOH","bundle":"https://pith.science/pith/DTM7XDXZGKZSJI2SVV5PYBBYOH/bundle.json","state":"https://pith.science/pith/DTM7XDXZGKZSJI2SVV5PYBBYOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTM7XDXZGKZSJI2SVV5PYBBYOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DTM7XDXZGKZSJI2SVV5PYBBYOH","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":"1008062406382dd2f072427285aeb44fff546e51e4e31bec28c51c5b4edcb4ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-16T02:03:04Z","title_canon_sha256":"1d931138a7f32a748ae7cbd52859379c0ca39d4dbcb67f2a148cd3e0e23219da"},"schema_version":"1.0","source":{"id":"2505.10789","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.10789","created_at":"2026-07-05T11:34:08Z"},{"alias_kind":"arxiv_version","alias_value":"2505.10789v3","created_at":"2026-07-05T11:34:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10789","created_at":"2026-07-05T11:34:08Z"},{"alias_kind":"pith_short_12","alias_value":"DTM7XDXZGKZS","created_at":"2026-07-05T11:34:08Z"},{"alias_kind":"pith_short_16","alias_value":"DTM7XDXZGKZSJI2S","created_at":"2026-07-05T11:34:08Z"},{"alias_kind":"pith_short_8","alias_value":"DTM7XDXZ","created_at":"2026-07-05T11:34:08Z"}],"graph_snapshots":[{"event_id":"sha256:f8f450743df8dd1e9ecd4ad1c3c967ce2df0b18a2e5e100d0a83e69ed9eaf4e0","target":"graph","created_at":"2026-07-05T11:34:08Z","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.10789/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide the first approximation quality guarantees for the Cuthull-McKee heuristic for reordering symmetric matrices to have low bandwidth, and we provide an algorithm for reconstructing bounded-bandwidth graphs from distance oracles with near-linear query complexity. To prove these results we introduce a new width parameter, BFS width, and we prove polylogarithmic upper and lower bounds on the BFS width of graphs of bounded bandwidth. Unlike other width parameters, such as bandwidth, pathwidth, and treewidth, BFS width can easily be computed in polynomial time. Bounded BFS width implies bo","authors_text":"David Eppstein, Michael T. Goodrich, Songyu Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10789","kind":"arxiv","version":3},"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:6ab1b3f9770e2562b232a04b450609c3738717523181ebe30c643486c0679d7a","target":"record","created_at":"2026-07-05T11:34:08Z","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":"1008062406382dd2f072427285aeb44fff546e51e4e31bec28c51c5b4edcb4ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-16T02:03:04Z","title_canon_sha256":"1d931138a7f32a748ae7cbd52859379c0ca39d4dbcb67f2a148cd3e0e23219da"},"schema_version":"1.0","source":{"id":"2505.10789","kind":"arxiv","version":3}},"canonical_sha256":"1cd9fb8ef932b324a352ad7afc043871da41643383da3eac1b58ec7bd49a0d3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cd9fb8ef932b324a352ad7afc043871da41643383da3eac1b58ec7bd49a0d3a","first_computed_at":"2026-07-05T11:34:08.334419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:34:08.334419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pmxC9ipcpofS05rXwTuhlk49gRpBZvfXuiID1ruykukV4bSOfp0lOQ4Xhhrj5x+hI28HTj55BHDj62c7DWnlDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:34:08.334967Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.10789","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ab1b3f9770e2562b232a04b450609c3738717523181ebe30c643486c0679d7a","sha256:f8f450743df8dd1e9ecd4ad1c3c967ce2df0b18a2e5e100d0a83e69ed9eaf4e0"],"state_sha256":"2a8e1afd936b5d699b1280b55e8cf98f092e83b203c740e77b35bdb5ef3bff6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CapX5TzmYfcADCZnW90ZXrdfI1gzAg8UHlTct0w0b9ugE57TgQFst0mpTKYb6iZGcNpTnLTWF+cdG7he3+W/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T04:13:33.609230Z","bundle_sha256":"5776cd1bfc76810e1cc95fc636786ce69944e07371e3fbe8081bf420633a05bf"}}