{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:T6ZZKNWITNCD26OXIL5TBLBF3Z","short_pith_number":"pith:T6ZZKNWI","canonical_record":{"source":{"id":"2508.01557","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-03T03:03:05Z","cross_cats_sorted":[],"title_canon_sha256":"fda50ce0bc1c10c93a900e54c738f443a37e39e410bb830cc3e8e57b89516b17","abstract_canon_sha256":"a62897f2087f974fd03adfa2bc37335cc283cccb6f36d2924bb28a538dee64bd"},"schema_version":"1.0"},"canonical_sha256":"9fb39536c89b443d79d742fb30ac25de73d25baedcc00c02736c6c5513fd24d3","source":{"kind":"arxiv","id":"2508.01557","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.01557","created_at":"2026-07-05T11:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"2508.01557v1","created_at":"2026-07-05T11:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01557","created_at":"2026-07-05T11:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"T6ZZKNWITNCD","created_at":"2026-07-05T11:47:41Z"},{"alias_kind":"pith_short_16","alias_value":"T6ZZKNWITNCD26OX","created_at":"2026-07-05T11:47:41Z"},{"alias_kind":"pith_short_8","alias_value":"T6ZZKNWI","created_at":"2026-07-05T11:47:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:T6ZZKNWITNCD26OXIL5TBLBF3Z","target":"record","payload":{"canonical_record":{"source":{"id":"2508.01557","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-03T03:03:05Z","cross_cats_sorted":[],"title_canon_sha256":"fda50ce0bc1c10c93a900e54c738f443a37e39e410bb830cc3e8e57b89516b17","abstract_canon_sha256":"a62897f2087f974fd03adfa2bc37335cc283cccb6f36d2924bb28a538dee64bd"},"schema_version":"1.0"},"canonical_sha256":"9fb39536c89b443d79d742fb30ac25de73d25baedcc00c02736c6c5513fd24d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:41.141014Z","signature_b64":"wP9Oa4Ph9saWWqU919rD6+LMG2fFCJomA+05/Fbt7VMD00bVPUzJh1Fx3/YlHnkv+NXqyoq/cFtyXQnj0fvlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb39536c89b443d79d742fb30ac25de73d25baedcc00c02736c6c5513fd24d3","last_reissued_at":"2026-07-05T11:47:41.140532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:41.140532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.01557","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-05T11:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPqKUUXf1985NrudpT5e9K7xnGNc9agI5q7jV05xz71zRhPS6y3EFPfbexfWOHba27g7lP1UMi6qopQFrepXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:09:13.894398Z"},"content_sha256":"b324606e05bb20389fc835e76bd7192ce40e65146410531e82322da94c636877","schema_version":"1.0","event_id":"sha256:b324606e05bb20389fc835e76bd7192ce40e65146410531e82322da94c636877"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:T6ZZKNWITNCD26OXIL5TBLBF3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised Learning for the Elementary Shortest Path Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jingyi Chen, Xinwu Qian, Xinyuan Zhang","submitted_at":"2025-08-03T03:03:05Z","abstract_excerpt":"The Elementary Shortest-Path Problem(ESPP) seeks a minimum cost path from s to t that visits each vertex at most once. The presence of negative-cost cycles renders the problem NP-hard. We present a probabilistic method for finding near-optimal ESPP, enabled by an unsupervised graph neural network that jointly learns node value estimates and edge-selection probabilities via a surrogate loss function. The loss provides a high probability certificate of finding near-optimal ESPP solutions by simultaneously reducing negative-cost cycles and embedding the desired algorithmic alignment. At inference"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01557","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/2508.01557/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-05T11:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i9acgHhQ6Px7MGuhsedz4YZZ+xvS26figjisAVsTki/QKOPWqQ7nHjwdnJT1+R6bsoPJ96vn3o8joLWQWslGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:09:13.894879Z"},"content_sha256":"61704cad6e4775ea38f21b0666ca46fabb86c3ada30fcf89d4d771a13f5159ea","schema_version":"1.0","event_id":"sha256:61704cad6e4775ea38f21b0666ca46fabb86c3ada30fcf89d4d771a13f5159ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T6ZZKNWITNCD26OXIL5TBLBF3Z/bundle.json","state_url":"https://pith.science/pith/T6ZZKNWITNCD26OXIL5TBLBF3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T6ZZKNWITNCD26OXIL5TBLBF3Z/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-09T12:09:13Z","links":{"resolver":"https://pith.science/pith/T6ZZKNWITNCD26OXIL5TBLBF3Z","bundle":"https://pith.science/pith/T6ZZKNWITNCD26OXIL5TBLBF3Z/bundle.json","state":"https://pith.science/pith/T6ZZKNWITNCD26OXIL5TBLBF3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T6ZZKNWITNCD26OXIL5TBLBF3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:T6ZZKNWITNCD26OXIL5TBLBF3Z","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":"a62897f2087f974fd03adfa2bc37335cc283cccb6f36d2924bb28a538dee64bd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-03T03:03:05Z","title_canon_sha256":"fda50ce0bc1c10c93a900e54c738f443a37e39e410bb830cc3e8e57b89516b17"},"schema_version":"1.0","source":{"id":"2508.01557","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.01557","created_at":"2026-07-05T11:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"2508.01557v1","created_at":"2026-07-05T11:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01557","created_at":"2026-07-05T11:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"T6ZZKNWITNCD","created_at":"2026-07-05T11:47:41Z"},{"alias_kind":"pith_short_16","alias_value":"T6ZZKNWITNCD26OX","created_at":"2026-07-05T11:47:41Z"},{"alias_kind":"pith_short_8","alias_value":"T6ZZKNWI","created_at":"2026-07-05T11:47:41Z"}],"graph_snapshots":[{"event_id":"sha256:61704cad6e4775ea38f21b0666ca46fabb86c3ada30fcf89d4d771a13f5159ea","target":"graph","created_at":"2026-07-05T11:47:41Z","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/2508.01557/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Elementary Shortest-Path Problem(ESPP) seeks a minimum cost path from s to t that visits each vertex at most once. The presence of negative-cost cycles renders the problem NP-hard. We present a probabilistic method for finding near-optimal ESPP, enabled by an unsupervised graph neural network that jointly learns node value estimates and edge-selection probabilities via a surrogate loss function. The loss provides a high probability certificate of finding near-optimal ESPP solutions by simultaneously reducing negative-cost cycles and embedding the desired algorithmic alignment. At inference","authors_text":"Jingyi Chen, Xinwu Qian, Xinyuan Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-03T03:03:05Z","title":"Unsupervised Learning for the Elementary Shortest Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01557","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:b324606e05bb20389fc835e76bd7192ce40e65146410531e82322da94c636877","target":"record","created_at":"2026-07-05T11:47:41Z","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":"a62897f2087f974fd03adfa2bc37335cc283cccb6f36d2924bb28a538dee64bd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-03T03:03:05Z","title_canon_sha256":"fda50ce0bc1c10c93a900e54c738f443a37e39e410bb830cc3e8e57b89516b17"},"schema_version":"1.0","source":{"id":"2508.01557","kind":"arxiv","version":1}},"canonical_sha256":"9fb39536c89b443d79d742fb30ac25de73d25baedcc00c02736c6c5513fd24d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fb39536c89b443d79d742fb30ac25de73d25baedcc00c02736c6c5513fd24d3","first_computed_at":"2026-07-05T11:47:41.140532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:47:41.140532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wP9Oa4Ph9saWWqU919rD6+LMG2fFCJomA+05/Fbt7VMD00bVPUzJh1Fx3/YlHnkv+NXqyoq/cFtyXQnj0fvlCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:47:41.141014Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.01557","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b324606e05bb20389fc835e76bd7192ce40e65146410531e82322da94c636877","sha256:61704cad6e4775ea38f21b0666ca46fabb86c3ada30fcf89d4d771a13f5159ea"],"state_sha256":"dac34ebda07b7550a9f3d4dab2a818b06870de3ed564f8fd71a868811a4c75d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HskFS5zik6F2x0EHKj3IuIPuB5JbVeUXQ1pTr8YTMcyD+ojv7AfJru0w2jnPmabbr5/GKnDgWkEW8RVdfPt8AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T12:09:13.898557Z","bundle_sha256":"52d25620085eacc5a8d517324397c0e15dc7bb238e2859e8c01e1bf0d29e9623"}}