{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PJSM6XFRQHBIUEQFMSEAUTJA57","short_pith_number":"pith:PJSM6XFR","canonical_record":{"source":{"id":"1404.4575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T16:32:27Z","cross_cats_sorted":[],"title_canon_sha256":"1b42af4a9e5797d9f2ea6d5a48b608eec1c8d1194a1dbc595612bc66625f3b45","abstract_canon_sha256":"5be5c5b2a3eb78b3d7f72b7bb3de9577deca802c25c5571b2848e34f44a1bd78"},"schema_version":"1.0"},"canonical_sha256":"7a64cf5cb181c28a120564880a4d20effd40699be50714e3c164bdc6f0f86206","source":{"kind":"arxiv","id":"1404.4575","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4575","created_at":"2026-05-18T02:54:03Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4575v1","created_at":"2026-05-18T02:54:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4575","created_at":"2026-05-18T02:54:03Z"},{"alias_kind":"pith_short_12","alias_value":"PJSM6XFRQHBI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJSM6XFRQHBIUEQF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJSM6XFR","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PJSM6XFRQHBIUEQFMSEAUTJA57","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T16:32:27Z","cross_cats_sorted":[],"title_canon_sha256":"1b42af4a9e5797d9f2ea6d5a48b608eec1c8d1194a1dbc595612bc66625f3b45","abstract_canon_sha256":"5be5c5b2a3eb78b3d7f72b7bb3de9577deca802c25c5571b2848e34f44a1bd78"},"schema_version":"1.0"},"canonical_sha256":"7a64cf5cb181c28a120564880a4d20effd40699be50714e3c164bdc6f0f86206","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:03.966890Z","signature_b64":"4xyzS58kP6FC0Yxe/aBftivxvJTwaToaEvCkTuxuBNtvSosvGu93uHCP6VUBffObqyGE9P3eW2X953+4+7bYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a64cf5cb181c28a120564880a4d20effd40699be50714e3c164bdc6f0f86206","last_reissued_at":"2026-05-18T02:54:03.966380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:03.966380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4575","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-18T02:54:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jy53rtZ+iAC0ASQYwpkAW1E6xeFIKTclXd751U61GRKuorz0MAobLCq+qLxwr7QZhVyQttH+iaAydzQFV3T+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:31:55.168137Z"},"content_sha256":"c778cad15662b44432103f1aac3c6f2e3da75fb376e15fdcf6a3a156fd8391b7","schema_version":"1.0","event_id":"sha256:c778cad15662b44432103f1aac3c6f2e3da75fb376e15fdcf6a3a156fd8391b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PJSM6XFRQHBIUEQFMSEAUTJA57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anand Louis, Yury Makarychev","submitted_at":"2014-04-17T16:32:27Z","abstract_excerpt":"The expansion of a hypergraph, a natural extension of the notion of expansion in graphs, is defined as the minimum over all cuts in the hypergraph of the ratio of the number of the hyperedges cut to the size of the smaller side of the cut. We study the Hypergraph Small Set Expansion problem, which, for a parameter $\\delta \\in (0,1/2]$, asks to compute the cut having the least expansion while having at most $\\delta$ fraction of the vertices on the smaller side of the cut. We present two algorithms. Our first algorithm gives an $\\tilde O(\\delta^{-1} \\sqrt{\\log n})$ approximation. The second algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4575","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-18T02:54:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MuIq4uR3Q/6W36au591ob8pj6V5h1rU/kkYuo3Y+XhOVPkODGLDng880gbFaTYf/8SM7/EFN7+DVhayxd6oYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:31:55.168882Z"},"content_sha256":"6383b35aa0cbce43fcdc8b71071d3ca6619a28d5d6bf9f608e7cbc95c5b9b303","schema_version":"1.0","event_id":"sha256:6383b35aa0cbce43fcdc8b71071d3ca6619a28d5d6bf9f608e7cbc95c5b9b303"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJSM6XFRQHBIUEQFMSEAUTJA57/bundle.json","state_url":"https://pith.science/pith/PJSM6XFRQHBIUEQFMSEAUTJA57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJSM6XFRQHBIUEQFMSEAUTJA57/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-05-24T15:31:55Z","links":{"resolver":"https://pith.science/pith/PJSM6XFRQHBIUEQFMSEAUTJA57","bundle":"https://pith.science/pith/PJSM6XFRQHBIUEQFMSEAUTJA57/bundle.json","state":"https://pith.science/pith/PJSM6XFRQHBIUEQFMSEAUTJA57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJSM6XFRQHBIUEQFMSEAUTJA57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PJSM6XFRQHBIUEQFMSEAUTJA57","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":"5be5c5b2a3eb78b3d7f72b7bb3de9577deca802c25c5571b2848e34f44a1bd78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T16:32:27Z","title_canon_sha256":"1b42af4a9e5797d9f2ea6d5a48b608eec1c8d1194a1dbc595612bc66625f3b45"},"schema_version":"1.0","source":{"id":"1404.4575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4575","created_at":"2026-05-18T02:54:03Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4575v1","created_at":"2026-05-18T02:54:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4575","created_at":"2026-05-18T02:54:03Z"},{"alias_kind":"pith_short_12","alias_value":"PJSM6XFRQHBI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJSM6XFRQHBIUEQF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJSM6XFR","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:6383b35aa0cbce43fcdc8b71071d3ca6619a28d5d6bf9f608e7cbc95c5b9b303","target":"graph","created_at":"2026-05-18T02:54:03Z","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":"The expansion of a hypergraph, a natural extension of the notion of expansion in graphs, is defined as the minimum over all cuts in the hypergraph of the ratio of the number of the hyperedges cut to the size of the smaller side of the cut. We study the Hypergraph Small Set Expansion problem, which, for a parameter $\\delta \\in (0,1/2]$, asks to compute the cut having the least expansion while having at most $\\delta$ fraction of the vertices on the smaller side of the cut. We present two algorithms. Our first algorithm gives an $\\tilde O(\\delta^{-1} \\sqrt{\\log n})$ approximation. The second algo","authors_text":"Anand Louis, Yury Makarychev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T16:32:27Z","title":"Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4575","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:c778cad15662b44432103f1aac3c6f2e3da75fb376e15fdcf6a3a156fd8391b7","target":"record","created_at":"2026-05-18T02:54:03Z","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":"5be5c5b2a3eb78b3d7f72b7bb3de9577deca802c25c5571b2848e34f44a1bd78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T16:32:27Z","title_canon_sha256":"1b42af4a9e5797d9f2ea6d5a48b608eec1c8d1194a1dbc595612bc66625f3b45"},"schema_version":"1.0","source":{"id":"1404.4575","kind":"arxiv","version":1}},"canonical_sha256":"7a64cf5cb181c28a120564880a4d20effd40699be50714e3c164bdc6f0f86206","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a64cf5cb181c28a120564880a4d20effd40699be50714e3c164bdc6f0f86206","first_computed_at":"2026-05-18T02:54:03.966380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:03.966380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4xyzS58kP6FC0Yxe/aBftivxvJTwaToaEvCkTuxuBNtvSosvGu93uHCP6VUBffObqyGE9P3eW2X953+4+7bYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:03.966890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c778cad15662b44432103f1aac3c6f2e3da75fb376e15fdcf6a3a156fd8391b7","sha256:6383b35aa0cbce43fcdc8b71071d3ca6619a28d5d6bf9f608e7cbc95c5b9b303"],"state_sha256":"108cc3db16c320fbf30d201e1845e23143238759317c65e404f22e46ce3e3bc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36sCQVscEB3QZkif8VIz+gfBfYU8MxpJyg1IN68gXKErN7o6D38NVXn8OAKzGClaZqNe/Uh9+MHpWI3aYiFnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T15:31:55.173103Z","bundle_sha256":"5a4c384eccd3acac73dc1f225db22ddd4e780d399b2ffce18549caa65b45a177"}}