{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DIZLXDITOSYAEUF6WVLGQD6RPO","short_pith_number":"pith:DIZLXDIT","schema_version":"1.0","canonical_sha256":"1a32bb8d1374b00250beb556680fd17bae564e58c3c33747028ede9ad3a8f447","source":{"kind":"arxiv","id":"1704.08200","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.08200","created_at":"2026-05-18T00:20:22.229057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08200v4","created_at":"2026-05-18T00:20:22.229057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08200","created_at":"2026-05-18T00:20:22.229057+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIZLXDITOSYA","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIZLXDITOSYAEUF6","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIZLXDIT","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO","json":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO.json","graph_json":"https://pith.science/api/pith-number/DIZLXDITOSYAEUF6WVLGQD6RPO/graph.json","events_json":"https://pith.science/api/pith-number/DIZLXDITOSYAEUF6WVLGQD6RPO/events.json","paper":"https://pith.science/paper/DIZLXDIT"},"agent_actions":{"view_html":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO","download_json":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO.json","view_paper":"https://pith.science/paper/DIZLXDIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08200&json=true","fetch_graph":"https://pith.science/api/pith-number/DIZLXDITOSYAEUF6WVLGQD6RPO/graph.json","fetch_events":"https://pith.science/api/pith-number/DIZLXDITOSYAEUF6WVLGQD6RPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO/action/storage_attestation","attest_author":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO/action/author_attestation","sign_citation":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO/action/citation_signature","submit_replication":"https://pith.science/pith/DIZLXDITOSYAEUF6WVLGQD6RPO/action/replication_record"}},"created_at":"2026-05-18T00:20:22.229057+00:00","updated_at":"2026-05-18T00:20:22.229057+00:00"}