{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NSIUDMX6DRJTZX3LZPNB6JCFL3","short_pith_number":"pith:NSIUDMX6","canonical_record":{"source":{"id":"2410.02526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-03T14:33:35Z","cross_cats_sorted":[],"title_canon_sha256":"0e605ede128cfbfd7f00b6aec79e99d4d07af28c697d2498f45a72ba0072974e","abstract_canon_sha256":"8af87956893448a3a5ac2e428fc92f5317841c3607cc169fafaf60b6593d592d"},"schema_version":"1.0"},"canonical_sha256":"6c9141b2fe1c533cdf6bcbda1f24455ecdb86a45e50da949e0c6a857c0fddae0","source":{"kind":"arxiv","id":"2410.02526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.02526","created_at":"2026-07-05T09:15:22Z"},{"alias_kind":"arxiv_version","alias_value":"2410.02526v1","created_at":"2026-07-05T09:15:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02526","created_at":"2026-07-05T09:15:22Z"},{"alias_kind":"pith_short_12","alias_value":"NSIUDMX6DRJT","created_at":"2026-07-05T09:15:22Z"},{"alias_kind":"pith_short_16","alias_value":"NSIUDMX6DRJTZX3L","created_at":"2026-07-05T09:15:22Z"},{"alias_kind":"pith_short_8","alias_value":"NSIUDMX6","created_at":"2026-07-05T09:15:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NSIUDMX6DRJTZX3LZPNB6JCFL3","target":"record","payload":{"canonical_record":{"source":{"id":"2410.02526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-03T14:33:35Z","cross_cats_sorted":[],"title_canon_sha256":"0e605ede128cfbfd7f00b6aec79e99d4d07af28c697d2498f45a72ba0072974e","abstract_canon_sha256":"8af87956893448a3a5ac2e428fc92f5317841c3607cc169fafaf60b6593d592d"},"schema_version":"1.0"},"canonical_sha256":"6c9141b2fe1c533cdf6bcbda1f24455ecdb86a45e50da949e0c6a857c0fddae0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:22.283859Z","signature_b64":"OlXFiEyt/G5LSFUJMZnbZ1LwW53DNmOO8Ibl9IjMWpzO1YRUMetHCpZB5TDMHU6ZTNM97OAWKJfXyrZDDpuUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c9141b2fe1c533cdf6bcbda1f24455ecdb86a45e50da949e0c6a857c0fddae0","last_reissued_at":"2026-07-05T09:15:22.283395Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:22.283395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.02526","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-07-05T09:15:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RhFQ+nRGilAn+8z43VYbvY5dDkdan7tsSdxLer9KcvYtkXdtj4EOiCDba9IzAF1Y8OhlSf21ecJp+G+iYrjMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T10:54:21.275054Z"},"content_sha256":"860c95ceaf9aaa4804735f40e2242a65500feb545c50c4ad0629168b4837792b","schema_version":"1.0","event_id":"sha256:860c95ceaf9aaa4804735f40e2242a65500feb545c50c4ad0629168b4837792b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NSIUDMX6DRJTZX3LZPNB6JCFL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectivity via convexity: Bounds on the edge expansion in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelika Wiegele, Melanie Siebenhofer, Timotej Hrga","submitted_at":"2024-10-03T14:33:35Z","abstract_excerpt":"Convexification techniques have gained increasing interest over the past decades. In this work, we apply a recently developed convexification technique for fractional programs by He, Liu and Tawarmalani (2024) to the problem of determining the edge expansion of a graph. Computing the edge expansion of a graph is a well-known, difficult combinatorial problem that seeks to partition the graph into two sets such that a fractional objective function is minimized.\n  We give a formulation of the edge expansion as a completely positive program and propose a relaxation as a doubly non-negative program"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02526","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.02526/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-05T09:15:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiRppXiBXN6wgsjp623QT5P2zzJ2WF3peQEQr3DJ3l9wbLs6DM+JasfWMC331XpxjcCcVfOLLD7lrtMZ4vzjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T10:54:21.275903Z"},"content_sha256":"30daa0db706bc765740ecbbd110c898e487ac442f91bac420dbca4d08a8df200","schema_version":"1.0","event_id":"sha256:30daa0db706bc765740ecbbd110c898e487ac442f91bac420dbca4d08a8df200"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSIUDMX6DRJTZX3LZPNB6JCFL3/bundle.json","state_url":"https://pith.science/pith/NSIUDMX6DRJTZX3LZPNB6JCFL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSIUDMX6DRJTZX3LZPNB6JCFL3/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-18T10:54:21Z","links":{"resolver":"https://pith.science/pith/NSIUDMX6DRJTZX3LZPNB6JCFL3","bundle":"https://pith.science/pith/NSIUDMX6DRJTZX3LZPNB6JCFL3/bundle.json","state":"https://pith.science/pith/NSIUDMX6DRJTZX3LZPNB6JCFL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSIUDMX6DRJTZX3LZPNB6JCFL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NSIUDMX6DRJTZX3LZPNB6JCFL3","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":"8af87956893448a3a5ac2e428fc92f5317841c3607cc169fafaf60b6593d592d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-03T14:33:35Z","title_canon_sha256":"0e605ede128cfbfd7f00b6aec79e99d4d07af28c697d2498f45a72ba0072974e"},"schema_version":"1.0","source":{"id":"2410.02526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.02526","created_at":"2026-07-05T09:15:22Z"},{"alias_kind":"arxiv_version","alias_value":"2410.02526v1","created_at":"2026-07-05T09:15:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02526","created_at":"2026-07-05T09:15:22Z"},{"alias_kind":"pith_short_12","alias_value":"NSIUDMX6DRJT","created_at":"2026-07-05T09:15:22Z"},{"alias_kind":"pith_short_16","alias_value":"NSIUDMX6DRJTZX3L","created_at":"2026-07-05T09:15:22Z"},{"alias_kind":"pith_short_8","alias_value":"NSIUDMX6","created_at":"2026-07-05T09:15:22Z"}],"graph_snapshots":[{"event_id":"sha256:30daa0db706bc765740ecbbd110c898e487ac442f91bac420dbca4d08a8df200","target":"graph","created_at":"2026-07-05T09:15:22Z","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/2410.02526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Convexification techniques have gained increasing interest over the past decades. In this work, we apply a recently developed convexification technique for fractional programs by He, Liu and Tawarmalani (2024) to the problem of determining the edge expansion of a graph. Computing the edge expansion of a graph is a well-known, difficult combinatorial problem that seeks to partition the graph into two sets such that a fractional objective function is minimized.\n  We give a formulation of the edge expansion as a completely positive program and propose a relaxation as a doubly non-negative program","authors_text":"Angelika Wiegele, Melanie Siebenhofer, Timotej Hrga","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-03T14:33:35Z","title":"Connectivity via convexity: Bounds on the edge expansion in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02526","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:860c95ceaf9aaa4804735f40e2242a65500feb545c50c4ad0629168b4837792b","target":"record","created_at":"2026-07-05T09:15:22Z","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":"8af87956893448a3a5ac2e428fc92f5317841c3607cc169fafaf60b6593d592d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-03T14:33:35Z","title_canon_sha256":"0e605ede128cfbfd7f00b6aec79e99d4d07af28c697d2498f45a72ba0072974e"},"schema_version":"1.0","source":{"id":"2410.02526","kind":"arxiv","version":1}},"canonical_sha256":"6c9141b2fe1c533cdf6bcbda1f24455ecdb86a45e50da949e0c6a857c0fddae0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c9141b2fe1c533cdf6bcbda1f24455ecdb86a45e50da949e0c6a857c0fddae0","first_computed_at":"2026-07-05T09:15:22.283395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:15:22.283395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OlXFiEyt/G5LSFUJMZnbZ1LwW53DNmOO8Ibl9IjMWpzO1YRUMetHCpZB5TDMHU6ZTNM97OAWKJfXyrZDDpuUAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:15:22.283859Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.02526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:860c95ceaf9aaa4804735f40e2242a65500feb545c50c4ad0629168b4837792b","sha256:30daa0db706bc765740ecbbd110c898e487ac442f91bac420dbca4d08a8df200"],"state_sha256":"37e8b604a61bb4f7ca5f3f13ae7c8c4965604ef3f7351846fe45af8d875ea295"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Q1VONftMHH5eoRBBUM3WLIppdQXP6Y3AgWazBa5e5qDpka217gxOQmNUky40znw+DIEBnDiXTFVOGIkPiTXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T10:54:21.282357Z","bundle_sha256":"78de741ea6a93b024580925fb63a8ecc11287f5b4be26833656e3e97e4372792"}}