{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:P5FZ5L56XANSQA6U6NBUGORNTY","short_pith_number":"pith:P5FZ5L56","canonical_record":{"source":{"id":"1512.06325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-12-20T06:04:48Z","cross_cats_sorted":[],"title_canon_sha256":"2059e6a9c374c4c7f7d19c8662001d9870ebdaa49333f096ba87c9d034787022","abstract_canon_sha256":"ee45907fc8800ef138e4ee9e2afbd8c7ae8421456a8c0940031791319bc2e852"},"schema_version":"1.0"},"canonical_sha256":"7f4b9eafbeb81b2803d4f343433a2d9e0ea4b87e7c4b1b68a6584fc583e4825c","source":{"kind":"arxiv","id":"1512.06325","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06325","created_at":"2026-05-18T01:24:00Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06325v1","created_at":"2026-05-18T01:24:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06325","created_at":"2026-05-18T01:24:00Z"},{"alias_kind":"pith_short_12","alias_value":"P5FZ5L56XANS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P5FZ5L56XANSQA6U","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P5FZ5L56","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:P5FZ5L56XANSQA6U6NBUGORNTY","target":"record","payload":{"canonical_record":{"source":{"id":"1512.06325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-12-20T06:04:48Z","cross_cats_sorted":[],"title_canon_sha256":"2059e6a9c374c4c7f7d19c8662001d9870ebdaa49333f096ba87c9d034787022","abstract_canon_sha256":"ee45907fc8800ef138e4ee9e2afbd8c7ae8421456a8c0940031791319bc2e852"},"schema_version":"1.0"},"canonical_sha256":"7f4b9eafbeb81b2803d4f343433a2d9e0ea4b87e7c4b1b68a6584fc583e4825c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:00.834560Z","signature_b64":"TxtLBv3HBjRzguhiLqBeZRhLkOPjrWcQzwTFXW9cC8l/nSek7XCyCb1TMxs6qKUn89UV/220GAL97Yv3deUOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f4b9eafbeb81b2803d4f343433a2d9e0ea4b87e7c4b1b68a6584fc583e4825c","last_reissued_at":"2026-05-18T01:24:00.833883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:00.833883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.06325","source_version":1,"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-05-18T01:24:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mW6X0rs8xz0J9SzU3rpaC5tbf9Ki9ooI0u37nVHE4rK5sdyh+sIJZQlcWpl6NxnGqlWIgMS855f4SEOzeS+7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:33.777616Z"},"content_sha256":"87051820f19fdfbf70a434a08a527417d076e4928b4e785fc53677a1cad7ff26","schema_version":"1.0","event_id":"sha256:87051820f19fdfbf70a434a08a527417d076e4928b4e785fc53677a1cad7ff26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:P5FZ5L56XANSQA6U6NBUGORNTY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Maximal Error of Spectral Approximation of Graph Bisection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"John C. Urschel, Ludmil T. Zikatanov","submitted_at":"2015-12-20T06:04:48Z","abstract_excerpt":"Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class of graphs, we prove that the standard spectral graph bisection can produce bisections that are far from optimal. In particular, we show that the maximum error in the spectral approximation of the optimal bisection (partition sizes exactly equal) cut for such graphs is bounded below by a constant multiple of the order of the graph squared."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06325","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"},"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-05-18T01:24:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlLM6BXK/G+6uPT0tazX6QFakGBgfk0vyJsKIUWk2vlqO1h4b71Nc9YmIMOzI9bkQVjArkfr3t5UzKgKgHw7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:33.777961Z"},"content_sha256":"626ebf9de044df9e75ca6aa4b868378f331502203f8853be2d2b267764a1fb76","schema_version":"1.0","event_id":"sha256:626ebf9de044df9e75ca6aa4b868378f331502203f8853be2d2b267764a1fb76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5FZ5L56XANSQA6U6NBUGORNTY/bundle.json","state_url":"https://pith.science/pith/P5FZ5L56XANSQA6U6NBUGORNTY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5FZ5L56XANSQA6U6NBUGORNTY/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-06-02T13:06:33Z","links":{"resolver":"https://pith.science/pith/P5FZ5L56XANSQA6U6NBUGORNTY","bundle":"https://pith.science/pith/P5FZ5L56XANSQA6U6NBUGORNTY/bundle.json","state":"https://pith.science/pith/P5FZ5L56XANSQA6U6NBUGORNTY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5FZ5L56XANSQA6U6NBUGORNTY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:P5FZ5L56XANSQA6U6NBUGORNTY","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":"ee45907fc8800ef138e4ee9e2afbd8c7ae8421456a8c0940031791319bc2e852","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-12-20T06:04:48Z","title_canon_sha256":"2059e6a9c374c4c7f7d19c8662001d9870ebdaa49333f096ba87c9d034787022"},"schema_version":"1.0","source":{"id":"1512.06325","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06325","created_at":"2026-05-18T01:24:00Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06325v1","created_at":"2026-05-18T01:24:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06325","created_at":"2026-05-18T01:24:00Z"},{"alias_kind":"pith_short_12","alias_value":"P5FZ5L56XANS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P5FZ5L56XANSQA6U","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P5FZ5L56","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:626ebf9de044df9e75ca6aa4b868378f331502203f8853be2d2b267764a1fb76","target":"graph","created_at":"2026-05-18T01:24:00Z","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"},"paper":{"abstract_excerpt":"Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class of graphs, we prove that the standard spectral graph bisection can produce bisections that are far from optimal. In particular, we show that the maximum error in the spectral approximation of the optimal bisection (partition sizes exactly equal) cut for such graphs is bounded below by a constant multiple of the order of the graph squared.","authors_text":"John C. Urschel, Ludmil T. Zikatanov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-12-20T06:04:48Z","title":"On the Maximal Error of Spectral Approximation of Graph Bisection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06325","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:87051820f19fdfbf70a434a08a527417d076e4928b4e785fc53677a1cad7ff26","target":"record","created_at":"2026-05-18T01:24:00Z","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":"ee45907fc8800ef138e4ee9e2afbd8c7ae8421456a8c0940031791319bc2e852","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-12-20T06:04:48Z","title_canon_sha256":"2059e6a9c374c4c7f7d19c8662001d9870ebdaa49333f096ba87c9d034787022"},"schema_version":"1.0","source":{"id":"1512.06325","kind":"arxiv","version":1}},"canonical_sha256":"7f4b9eafbeb81b2803d4f343433a2d9e0ea4b87e7c4b1b68a6584fc583e4825c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f4b9eafbeb81b2803d4f343433a2d9e0ea4b87e7c4b1b68a6584fc583e4825c","first_computed_at":"2026-05-18T01:24:00.833883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:00.833883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TxtLBv3HBjRzguhiLqBeZRhLkOPjrWcQzwTFXW9cC8l/nSek7XCyCb1TMxs6qKUn89UV/220GAL97Yv3deUOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:00.834560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06325","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87051820f19fdfbf70a434a08a527417d076e4928b4e785fc53677a1cad7ff26","sha256:626ebf9de044df9e75ca6aa4b868378f331502203f8853be2d2b267764a1fb76"],"state_sha256":"b210300db4320c96244b48ddecac33298b445d21d9829e0fc300dfcc87a63109"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7sncK9EBGpwEEFxAY48xYJs07FsWoPtb/pQsdOBruPo3AkvB+ZkDRWUdUz8TbcioFy8V72SlS/tzLdCvFf5BAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:06:33.780134Z","bundle_sha256":"a719ca2579d879938ac8039bc3f335921cfc722aff4013f248d5087f0af130f5"}}