{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DIZLXDITOSYAEUF6WVLGQD6RPO","short_pith_number":"pith:DIZLXDIT","canonical_record":{"source":{"id":"1704.08200","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-26T16:37:42Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"0215d9cbee7b6774a42e89dd2df25f7f9c0c908bcd05cbd9957469b2ac4352a0","abstract_canon_sha256":"f73474ed1e896fd3559ecc3cdb598bc2dbb83ef4b05d377c1012844f45799109"},"schema_version":"1.0"},"canonical_sha256":"1a32bb8d1374b00250beb556680fd17bae564e58c3c33747028ede9ad3a8f447","source":{"kind":"arxiv","id":"1704.08200","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08200","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08200v4","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08200","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"DIZLXDITOSYA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DIZLXDITOSYAEUF6","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DIZLXDIT","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DIZLXDITOSYAEUF6WVLGQD6RPO","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08200","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-26T16:37:42Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"0215d9cbee7b6774a42e89dd2df25f7f9c0c908bcd05cbd9957469b2ac4352a0","abstract_canon_sha256":"f73474ed1e896fd3559ecc3cdb598bc2dbb83ef4b05d377c1012844f45799109"},"schema_version":"1.0"},"canonical_sha256":"1a32bb8d1374b00250beb556680fd17bae564e58c3c33747028ede9ad3a8f447","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:22.229557Z","signature_b64":"80QgNH6D7E18zEK7Luaa6s3kf2UWTKwrU/bNflQuyQVYRE686MZ2M+Hcxa508GSpMsgRf6UrN/iwOYROnN8dDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a32bb8d1374b00250beb556680fd17bae564e58c3c33747028ede9ad3a8f447","last_reissued_at":"2026-05-18T00:20:22.228980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:22.228980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08200","source_version":4,"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-18T00:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMQ0LpSEU8jBI10DNWmxmx2K8IlmhQ7JrgFii/GvwRCO1soLoCCRlFLCI7+zF1BrrRBJVIjkZg0B6WmcPXZ5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:39:50.672959Z"},"content_sha256":"f8444c1f62ee12dcc6a15f8b8e564a64f3b4bbc1c905a43b2539765da3015e52","schema_version":"1.0","event_id":"sha256:f8444c1f62ee12dcc6a15f8b8e564a64f3b4bbc1c905a43b2539765da3015e52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DIZLXDITOSYAEUF6WVLGQD6RPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quadratically-Regularized Optimal Transport on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Justin Solomon, Montacer Essid","submitted_at":"2017-04-26T16:37:42Z","abstract_excerpt":"Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to express challenging tasks involving matching supply to demand with minimal shipment expense; in discrete language, these become minimum-cost network flow problems. Regularization typically is needed to ensure uniqueness for the linear ground distance case and to improve optimization convergence; state-of-the-art techniques employ entropic regularization on the tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08200","kind":"arxiv","version":4},"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-18T00:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HWJIofEnCTATYq5JIlB+NiPzojTzsjP6U9b87fE3ib5zErfHg5eG0lHZAEvHf5dcSrBn1tnl/V6CYaYX/8iGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:39:50.673291Z"},"content_sha256":"6e1f488f69010736ec10ad033299ddfdd5f1ecf590b253129dd48deb87200633","schema_version":"1.0","event_id":"sha256:6e1f488f69010736ec10ad033299ddfdd5f1ecf590b253129dd48deb87200633"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO/bundle.json","state_url":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DIZLXDITOSYAEUF6WVLGQD6RPO/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-06-24T20:39:50Z","links":{"resolver":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO","bundle":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO/bundle.json","state":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DIZLXDITOSYAEUF6WVLGQD6RPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DIZLXDITOSYAEUF6WVLGQD6RPO","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":"f73474ed1e896fd3559ecc3cdb598bc2dbb83ef4b05d377c1012844f45799109","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-26T16:37:42Z","title_canon_sha256":"0215d9cbee7b6774a42e89dd2df25f7f9c0c908bcd05cbd9957469b2ac4352a0"},"schema_version":"1.0","source":{"id":"1704.08200","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08200","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08200v4","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08200","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"DIZLXDITOSYA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DIZLXDITOSYAEUF6","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DIZLXDIT","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:6e1f488f69010736ec10ad033299ddfdd5f1ecf590b253129dd48deb87200633","target":"graph","created_at":"2026-05-18T00:20:22Z","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":"Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to express challenging tasks involving matching supply to demand with minimal shipment expense; in discrete language, these become minimum-cost network flow problems. Regularization typically is needed to ensure uniqueness for the linear ground distance case and to improve optimization convergence; state-of-the-art techniques employ entropic regularization on the tr","authors_text":"Justin Solomon, Montacer Essid","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-26T16:37:42Z","title":"Quadratically-Regularized Optimal Transport on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08200","kind":"arxiv","version":4},"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:f8444c1f62ee12dcc6a15f8b8e564a64f3b4bbc1c905a43b2539765da3015e52","target":"record","created_at":"2026-05-18T00:20:22Z","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":"f73474ed1e896fd3559ecc3cdb598bc2dbb83ef4b05d377c1012844f45799109","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-26T16:37:42Z","title_canon_sha256":"0215d9cbee7b6774a42e89dd2df25f7f9c0c908bcd05cbd9957469b2ac4352a0"},"schema_version":"1.0","source":{"id":"1704.08200","kind":"arxiv","version":4}},"canonical_sha256":"1a32bb8d1374b00250beb556680fd17bae564e58c3c33747028ede9ad3a8f447","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a32bb8d1374b00250beb556680fd17bae564e58c3c33747028ede9ad3a8f447","first_computed_at":"2026-05-18T00:20:22.228980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:22.228980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"80QgNH6D7E18zEK7Luaa6s3kf2UWTKwrU/bNflQuyQVYRE686MZ2M+Hcxa508GSpMsgRf6UrN/iwOYROnN8dDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:22.229557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08200","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8444c1f62ee12dcc6a15f8b8e564a64f3b4bbc1c905a43b2539765da3015e52","sha256:6e1f488f69010736ec10ad033299ddfdd5f1ecf590b253129dd48deb87200633"],"state_sha256":"404c6d18cdb022dcde3afe72d6c803f9637337145aafe1469d865a912778ed49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8CfnoP5IHsAP5xGxg1ngjL0GuZdft4D4mXvXAt2yg727mpToy32xuOJlBajOdnfnkDp7EaKA2MY5uPxzYucCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:39:50.675189Z","bundle_sha256":"7e913727eeb00bfbf3788a2ad3ee2458cdbdd5f903acb01643f1ab390e83258a"}}