{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DXGSRSGYL3TSUXF6SNLHVW33W2","short_pith_number":"pith:DXGSRSGY","canonical_record":{"source":{"id":"1903.00614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-02T03:06:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2a0e925ceca89a93cd8c92478def9a8ee7526f4a34c7cd50e3fe47d4a3fa5a56","abstract_canon_sha256":"3b2953b313f139387fd342e197ba1f4adbaed119ff2feb7329f37cab99cb3202"},"schema_version":"1.0"},"canonical_sha256":"1dcd28c8d85ee72a5cbe93567adb7bb6bbe41cfbbd99491b66e3dbc73845024c","source":{"kind":"arxiv","id":"1903.00614","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00614","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00614v1","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00614","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"DXGSRSGYL3TS","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DXGSRSGYL3TSUXF6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DXGSRSGY","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DXGSRSGYL3TSUXF6SNLHVW33W2","target":"record","payload":{"canonical_record":{"source":{"id":"1903.00614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-02T03:06:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2a0e925ceca89a93cd8c92478def9a8ee7526f4a34c7cd50e3fe47d4a3fa5a56","abstract_canon_sha256":"3b2953b313f139387fd342e197ba1f4adbaed119ff2feb7329f37cab99cb3202"},"schema_version":"1.0"},"canonical_sha256":"1dcd28c8d85ee72a5cbe93567adb7bb6bbe41cfbbd99491b66e3dbc73845024c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:14.009123Z","signature_b64":"NvltzdUCJHxwFLfaiIMYxwJGOMON+KNPYpHgxvEyWo3qHheEBbz+w6wWWSbbcBDa03hc/Mt3ShZ8548cRdOaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dcd28c8d85ee72a5cbe93567adb7bb6bbe41cfbbd99491b66e3dbc73845024c","last_reissued_at":"2026-05-17T23:52:14.008374Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:14.008374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.00614","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-17T23:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IlAmBja7tzfUG48eeonnErK7u39Ol3Y6Jog7G0oW+MFHB1kYcN3bnkR3oudrYdPup635XF14jw74a7w/GPFhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:52:02.691189Z"},"content_sha256":"c62b9422b26d760b0a5cfd8830a399b6719ac38e17f2ba88316f8f940863ad29","schema_version":"1.0","event_id":"sha256:c62b9422b26d760b0a5cfd8830a399b6719ac38e17f2ba88316f8f940863ad29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DXGSRSGYL3TSUXF6SNLHVW33W2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GAP: Generalizable Approximate Graph Partitioning Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anna Goldie, Azade Nazi, Azalia Mirhoseini, Sujith Ravi, Will Hang","submitted_at":"2019-03-02T03:06:00Z","abstract_excerpt":"Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions. Due to its combinatorial nature, many approximate solutions have been developed, including variants of multi-level methods and spectral clustering. We propose GAP, a Generalizable Approximate Partitioning framework that takes a deep learning approach to graph partitioning. We define a differentiable loss function that represents the partitioning objective and use backpropagation to optimize the network parameters. Unlike baselines that redo the optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00614","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-17T23:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5nm/8oHSNx/MifhX32SBm0IwX2VC+z+m2V0DVNuWQZWogHz9pqk6p1kptRyGvNmEUBLc7Gnhbb80iftFbyRTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:52:02.691888Z"},"content_sha256":"94574382fd98118696763f2d69e12de5b99e77f25bb4503881e4d0fb0c18233c","schema_version":"1.0","event_id":"sha256:94574382fd98118696763f2d69e12de5b99e77f25bb4503881e4d0fb0c18233c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXGSRSGYL3TSUXF6SNLHVW33W2/bundle.json","state_url":"https://pith.science/pith/DXGSRSGYL3TSUXF6SNLHVW33W2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXGSRSGYL3TSUXF6SNLHVW33W2/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-19T01:52:02Z","links":{"resolver":"https://pith.science/pith/DXGSRSGYL3TSUXF6SNLHVW33W2","bundle":"https://pith.science/pith/DXGSRSGYL3TSUXF6SNLHVW33W2/bundle.json","state":"https://pith.science/pith/DXGSRSGYL3TSUXF6SNLHVW33W2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXGSRSGYL3TSUXF6SNLHVW33W2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DXGSRSGYL3TSUXF6SNLHVW33W2","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":"3b2953b313f139387fd342e197ba1f4adbaed119ff2feb7329f37cab99cb3202","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-02T03:06:00Z","title_canon_sha256":"2a0e925ceca89a93cd8c92478def9a8ee7526f4a34c7cd50e3fe47d4a3fa5a56"},"schema_version":"1.0","source":{"id":"1903.00614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00614","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00614v1","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00614","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"DXGSRSGYL3TS","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DXGSRSGYL3TSUXF6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DXGSRSGY","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:94574382fd98118696763f2d69e12de5b99e77f25bb4503881e4d0fb0c18233c","target":"graph","created_at":"2026-05-17T23:52:14Z","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":"Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions. Due to its combinatorial nature, many approximate solutions have been developed, including variants of multi-level methods and spectral clustering. We propose GAP, a Generalizable Approximate Partitioning framework that takes a deep learning approach to graph partitioning. We define a differentiable loss function that represents the partitioning objective and use backpropagation to optimize the network parameters. Unlike baselines that redo the optimi","authors_text":"Anna Goldie, Azade Nazi, Azalia Mirhoseini, Sujith Ravi, Will Hang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-02T03:06:00Z","title":"GAP: Generalizable Approximate Graph Partitioning Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00614","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:c62b9422b26d760b0a5cfd8830a399b6719ac38e17f2ba88316f8f940863ad29","target":"record","created_at":"2026-05-17T23:52:14Z","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":"3b2953b313f139387fd342e197ba1f4adbaed119ff2feb7329f37cab99cb3202","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-02T03:06:00Z","title_canon_sha256":"2a0e925ceca89a93cd8c92478def9a8ee7526f4a34c7cd50e3fe47d4a3fa5a56"},"schema_version":"1.0","source":{"id":"1903.00614","kind":"arxiv","version":1}},"canonical_sha256":"1dcd28c8d85ee72a5cbe93567adb7bb6bbe41cfbbd99491b66e3dbc73845024c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dcd28c8d85ee72a5cbe93567adb7bb6bbe41cfbbd99491b66e3dbc73845024c","first_computed_at":"2026-05-17T23:52:14.008374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:14.008374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NvltzdUCJHxwFLfaiIMYxwJGOMON+KNPYpHgxvEyWo3qHheEBbz+w6wWWSbbcBDa03hc/Mt3ShZ8548cRdOaCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:14.009123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c62b9422b26d760b0a5cfd8830a399b6719ac38e17f2ba88316f8f940863ad29","sha256:94574382fd98118696763f2d69e12de5b99e77f25bb4503881e4d0fb0c18233c"],"state_sha256":"9728fb46f83a9f59ef565b2a2985fbb8370f0e051f65626f07fbe184dad2b927"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5icEyJXGoZzYPkwek1pkSaw7LeFTJqg5vOrQ+9GoEZBMXzkvmsC2EiwwMoIGiXh8dxHUWzMImHQzseyrpojQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T01:52:02.693998Z","bundle_sha256":"087f83f77ece290af2ef325952b645003210f5f6f51541692ad29b0d6c0bbcdb"}}