{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3TFDKYLNBXOWNK4SYDRVPMOVTX","short_pith_number":"pith:3TFDKYLN","schema_version":"1.0","canonical_sha256":"dcca35616d0ddd66ab92c0e357b1d59de38e69bf56b7c6463b642f385c052208","source":{"kind":"arxiv","id":"2602.04675","version":2},"attestation_state":"computed","paper":{"title":"Generalized Schr\\\"odinger Bridge on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Evangelos Theodorou, Jaemoo Choi, Juno Nam, Panagiotis Theodoropoulos","submitted_at":"2026-02-04T15:48:09Z","abstract_excerpt":"Transportation on graphs is a fundamental challenge across many domains, where decisions must respect topological and operational constraints. Despite the need for actionable policies, existing graph-transport methods lack this expressivity. They rely on restrictive assumptions, fail to generalize across sparse topologies, and scale poorly with graph size and time horizon. To address these issues, we introduce Generalized Schr\\\"odinger Bridge on Graphs (GSBoG), a novel scalable data-driven framework for learning executable controlled continuous-time Markov chain (CTMC) policies on arbitrary gr"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2602.04675","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-04T15:48:09Z","cross_cats_sorted":[],"title_canon_sha256":"c0c5af19787ce2914bca04c077470069e0637698cb190b50c0aafd64baedb86c","abstract_canon_sha256":"77e22b85df2823e6968730fb79fe1383b21bcecb969c92b78f2292cb8ef4a219"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:08:22.160298Z","signature_b64":"tbLFOLmWUlsRdDV40q/L1lJ7PggkWczo0maBAk95q98todO6p07GDA4bTEnHng/5irr3CA5DOo2eZLMtpzvmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcca35616d0ddd66ab92c0e357b1d59de38e69bf56b7c6463b642f385c052208","last_reissued_at":"2026-06-12T01:08:22.159113Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:08:22.159113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Schr\\\"odinger Bridge on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Evangelos Theodorou, Jaemoo Choi, Juno Nam, Panagiotis Theodoropoulos","submitted_at":"2026-02-04T15:48:09Z","abstract_excerpt":"Transportation on graphs is a fundamental challenge across many domains, where decisions must respect topological and operational constraints. Despite the need for actionable policies, existing graph-transport methods lack this expressivity. They rely on restrictive assumptions, fail to generalize across sparse topologies, and scale poorly with graph size and time horizon. To address these issues, we introduce Generalized Schr\\\"odinger Bridge on Graphs (GSBoG), a novel scalable data-driven framework for learning executable controlled continuous-time Markov chain (CTMC) policies on arbitrary gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.04675","kind":"arxiv","version":2},"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/2602.04675/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2602.04675","created_at":"2026-06-12T01:08:22.159249+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.04675v2","created_at":"2026-06-12T01:08:22.159249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.04675","created_at":"2026-06-12T01:08:22.159249+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TFDKYLNBXOW","created_at":"2026-06-12T01:08:22.159249+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TFDKYLNBXOWNK4S","created_at":"2026-06-12T01:08:22.159249+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TFDKYLN","created_at":"2026-06-12T01:08:22.159249+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.09349","citing_title":"Mutual Information Optimal Density Control of Linear Systems and Generalized Schr\\\"{o}dinger Bridges with Reference Refinement","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3TFDKYLNBXOWNK4SYDRVPMOVTX","json":"https://pith.science/pith/3TFDKYLNBXOWNK4SYDRVPMOVTX.json","graph_json":"https://pith.science/api/pith-number/3TFDKYLNBXOWNK4SYDRVPMOVTX/graph.json","events_json":"https://pith.science/api/pith-number/3TFDKYLNBXOWNK4SYDRVPMOVTX/events.json","paper":"https://pith.science/paper/3TFDKYLN"},"agent_actions":{"view_html":"https://pith.science/pith/3TFDKYLNBXOWNK4SYDRVPMOVTX","download_json":"https://pith.science/pith/3TFDKYLNBXOWNK4SYDRVPMOVTX.json","view_paper":"https://pith.science/paper/3TFDKYLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.04675&json=true","fetch_graph":"https://pith.science/api/pith-number/3TFDKYLNBXOWNK4SYDRVPMOVTX/graph.json","fetch_events":"https://pith.science/api/pith-number/3TFDKYLNBXOWNK4SYDRVPMOVTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TFDKYLNBXOWNK4SYDRVPMOVTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TFDKYLNBXOWNK4SYDRVPMOVTX/action/storage_attestation","attest_author":"https://pith.science/pith/3TFDKYLNBXOWNK4SYDRVPMOVTX/action/author_attestation","sign_citation":"https://pith.science/pith/3TFDKYLNBXOWNK4SYDRVPMOVTX/action/citation_signature","submit_replication":"https://pith.science/pith/3TFDKYLNBXOWNK4SYDRVPMOVTX/action/replication_record"}},"created_at":"2026-06-12T01:08:22.159249+00:00","updated_at":"2026-06-12T01:08:22.159249+00:00"}