{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SWHL7U4RHJWE7XX5CVQ566FMEK","short_pith_number":"pith:SWHL7U4R","canonical_record":{"source":{"id":"2310.11787","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-18T08:27:09Z","cross_cats_sorted":[],"title_canon_sha256":"835836c3f084edc282c3c9130507cf59d73d603cf46f928cc7b9b89d01476c81","abstract_canon_sha256":"8c207eb75b804376a16c4cbb8a44bef3468a3618e4cae621fa904a7d7f7ea998"},"schema_version":"1.0"},"canonical_sha256":"958ebfd3913a6c4fdefd1561df78ac22b34649e492776b2177a5166a8d9807fe","source":{"kind":"arxiv","id":"2310.11787","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.11787","created_at":"2026-07-05T08:34:56Z"},{"alias_kind":"arxiv_version","alias_value":"2310.11787v3","created_at":"2026-07-05T08:34:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11787","created_at":"2026-07-05T08:34:56Z"},{"alias_kind":"pith_short_12","alias_value":"SWHL7U4RHJWE","created_at":"2026-07-05T08:34:56Z"},{"alias_kind":"pith_short_16","alias_value":"SWHL7U4RHJWE7XX5","created_at":"2026-07-05T08:34:56Z"},{"alias_kind":"pith_short_8","alias_value":"SWHL7U4R","created_at":"2026-07-05T08:34:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SWHL7U4RHJWE7XX5CVQ566FMEK","target":"record","payload":{"canonical_record":{"source":{"id":"2310.11787","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-18T08:27:09Z","cross_cats_sorted":[],"title_canon_sha256":"835836c3f084edc282c3c9130507cf59d73d603cf46f928cc7b9b89d01476c81","abstract_canon_sha256":"8c207eb75b804376a16c4cbb8a44bef3468a3618e4cae621fa904a7d7f7ea998"},"schema_version":"1.0"},"canonical_sha256":"958ebfd3913a6c4fdefd1561df78ac22b34649e492776b2177a5166a8d9807fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:56.622781Z","signature_b64":"tPAF2vEbvE5WosDyQtQN2pOdODX9rQpzHA4x030kU8kK87ghdNtZBlmCVSbf+jHU9k8zfI1f8LLkZ+p8iV4wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"958ebfd3913a6c4fdefd1561df78ac22b34649e492776b2177a5166a8d9807fe","last_reissued_at":"2026-07-05T08:34:56.622349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:56.622349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.11787","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-05T08:34:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXK3UTxhnoWRHPx1+jcfFVuGbi7PKLUs3Sy+g4O2tm6M3xTu7/0pWLj4cgvKfTBuKkonh4x7BSSrcPHWNfc+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T04:58:07.930227Z"},"content_sha256":"50c1d941f0f9849d028da33cbea6eceb1d647be53f2725e2e3059d03202ba33c","schema_version":"1.0","event_id":"sha256:50c1d941f0f9849d028da33cbea6eceb1d647be53f2725e2e3059d03202ba33c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SWHL7U4RHJWE7XX5CVQ566FMEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NeuroCUT: A Neural Approach for Robust Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Krishnanshu Jain, Rishi Shah, Sahil Manchanda, Sayan Ranu, Sourav Medya","submitted_at":"2023-10-18T08:27:09Z","abstract_excerpt":"Graph partitioning aims to divide a graph into disjoint subsets while optimizing a specific partitioning objective. The majority of formulations related to graph partitioning exhibit NP-hardness due to their combinatorial nature. Conventional methods, like approximation algorithms or heuristics, are designed for distinct partitioning objectives and fail to achieve generalization across other important partitioning objectives. Recently machine learning-based methods have been developed that learn directly from data. Further, these methods have a distinct advantage of utilizing node features tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11787","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/2310.11787/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-05T08:34:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fRmpXyjhlgmDbpdfraX4ax0oIBQGvNbla8uwkiLJ+lb260nWgUIUKiqw/dM8G5UAPZyep26U2Ik8LhyPuuWfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T04:58:07.931113Z"},"content_sha256":"a6b3e826dc555d0a754b1f0d4ded60f0a03c4b6808466a284b1ed3f76d9ace7d","schema_version":"1.0","event_id":"sha256:a6b3e826dc555d0a754b1f0d4ded60f0a03c4b6808466a284b1ed3f76d9ace7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWHL7U4RHJWE7XX5CVQ566FMEK/bundle.json","state_url":"https://pith.science/pith/SWHL7U4RHJWE7XX5CVQ566FMEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWHL7U4RHJWE7XX5CVQ566FMEK/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-01T04:58:07Z","links":{"resolver":"https://pith.science/pith/SWHL7U4RHJWE7XX5CVQ566FMEK","bundle":"https://pith.science/pith/SWHL7U4RHJWE7XX5CVQ566FMEK/bundle.json","state":"https://pith.science/pith/SWHL7U4RHJWE7XX5CVQ566FMEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWHL7U4RHJWE7XX5CVQ566FMEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SWHL7U4RHJWE7XX5CVQ566FMEK","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":"8c207eb75b804376a16c4cbb8a44bef3468a3618e4cae621fa904a7d7f7ea998","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-18T08:27:09Z","title_canon_sha256":"835836c3f084edc282c3c9130507cf59d73d603cf46f928cc7b9b89d01476c81"},"schema_version":"1.0","source":{"id":"2310.11787","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.11787","created_at":"2026-07-05T08:34:56Z"},{"alias_kind":"arxiv_version","alias_value":"2310.11787v3","created_at":"2026-07-05T08:34:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11787","created_at":"2026-07-05T08:34:56Z"},{"alias_kind":"pith_short_12","alias_value":"SWHL7U4RHJWE","created_at":"2026-07-05T08:34:56Z"},{"alias_kind":"pith_short_16","alias_value":"SWHL7U4RHJWE7XX5","created_at":"2026-07-05T08:34:56Z"},{"alias_kind":"pith_short_8","alias_value":"SWHL7U4R","created_at":"2026-07-05T08:34:56Z"}],"graph_snapshots":[{"event_id":"sha256:a6b3e826dc555d0a754b1f0d4ded60f0a03c4b6808466a284b1ed3f76d9ace7d","target":"graph","created_at":"2026-07-05T08:34:56Z","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/2310.11787/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph partitioning aims to divide a graph into disjoint subsets while optimizing a specific partitioning objective. The majority of formulations related to graph partitioning exhibit NP-hardness due to their combinatorial nature. Conventional methods, like approximation algorithms or heuristics, are designed for distinct partitioning objectives and fail to achieve generalization across other important partitioning objectives. Recently machine learning-based methods have been developed that learn directly from data. Further, these methods have a distinct advantage of utilizing node features tha","authors_text":"Krishnanshu Jain, Rishi Shah, Sahil Manchanda, Sayan Ranu, Sourav Medya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-18T08:27:09Z","title":"NeuroCUT: A Neural Approach for Robust Graph Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11787","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:50c1d941f0f9849d028da33cbea6eceb1d647be53f2725e2e3059d03202ba33c","target":"record","created_at":"2026-07-05T08:34:56Z","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":"8c207eb75b804376a16c4cbb8a44bef3468a3618e4cae621fa904a7d7f7ea998","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-18T08:27:09Z","title_canon_sha256":"835836c3f084edc282c3c9130507cf59d73d603cf46f928cc7b9b89d01476c81"},"schema_version":"1.0","source":{"id":"2310.11787","kind":"arxiv","version":3}},"canonical_sha256":"958ebfd3913a6c4fdefd1561df78ac22b34649e492776b2177a5166a8d9807fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"958ebfd3913a6c4fdefd1561df78ac22b34649e492776b2177a5166a8d9807fe","first_computed_at":"2026-07-05T08:34:56.622349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:34:56.622349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tPAF2vEbvE5WosDyQtQN2pOdODX9rQpzHA4x030kU8kK87ghdNtZBlmCVSbf+jHU9k8zfI1f8LLkZ+p8iV4wCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:34:56.622781Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.11787","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50c1d941f0f9849d028da33cbea6eceb1d647be53f2725e2e3059d03202ba33c","sha256:a6b3e826dc555d0a754b1f0d4ded60f0a03c4b6808466a284b1ed3f76d9ace7d"],"state_sha256":"61b8361bb6c23a8568eb2245cbe08f4fe19ece0fc8d956e54ea853fd11564c0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"urXQKXwIrtNBg4Rn9r1Mb2HcF42FedazUIK5CBqrf7G4J4wQ7dl5jGQKqWsbDxhmm3K7G5S5Hvap/i88oZRRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T04:58:07.935062Z","bundle_sha256":"0135edc58e6dbfa2ceb871fd67c6dafabb141ef73d176fc4c44de85a3a4801a4"}}