{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4NQGG37C4AFMLFDUDYZECXIAU5","short_pith_number":"pith:4NQGG37C","canonical_record":{"source":{"id":"1603.06927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2016-03-22T19:39:18Z","cross_cats_sorted":[],"title_canon_sha256":"e781cc48668558566b102ea4743c4264ba0b0dfe999ebe9689dea4a4da8b414a","abstract_canon_sha256":"1de2056d512a1cc6ba8ba648035d3fc7d68ae4852a4b7cb10d089ea16dc3848a"},"schema_version":"1.0"},"canonical_sha256":"e360636fe2e00ac594741e32415d00a75a2704eb459050120144ce44342b0804","source":{"kind":"arxiv","id":"1603.06927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06927","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06927v1","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06927","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"4NQGG37C4AFM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4NQGG37C4AFMLFDU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4NQGG37C","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4NQGG37C4AFMLFDUDYZECXIAU5","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2016-03-22T19:39:18Z","cross_cats_sorted":[],"title_canon_sha256":"e781cc48668558566b102ea4743c4264ba0b0dfe999ebe9689dea4a4da8b414a","abstract_canon_sha256":"1de2056d512a1cc6ba8ba648035d3fc7d68ae4852a4b7cb10d089ea16dc3848a"},"schema_version":"1.0"},"canonical_sha256":"e360636fe2e00ac594741e32415d00a75a2704eb459050120144ce44342b0804","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:34.411838Z","signature_b64":"I7UEthaQeIB5jdprLufSSM8eLcCoNw0rmtxjw1DNdm58RfoMqcOgOK+qsVCQYSs9uX+NFwXvCQ0b8Et1z/9GCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e360636fe2e00ac594741e32415d00a75a2704eb459050120144ce44342b0804","last_reissued_at":"2026-05-18T01:18:34.411338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:34.411338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06927","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-05-18T01:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AtpfY46aMX0Ujq9cXnk1G/Bw2tlSRsFPdRXS5dFNL2V5pCGzfvKh2qH3upzlGLZE/Ocn6FtiGprimmOB4/AGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:17:38.759180Z"},"content_sha256":"cb9ff14235e8c4983e33655449f130348ab85a8ff9651362dbc447ffedde5e4b","schema_version":"1.0","event_id":"sha256:cb9ff14235e8c4983e33655449f130348ab85a8ff9651362dbc447ffedde5e4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4NQGG37C4AFMLFDUDYZECXIAU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous-Flow Graph Transportation Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Adrian Butscher, Justin Solomon, Leonidas Guibas, Raif Rustamov","submitted_at":"2016-03-22T19:39:18Z","abstract_excerpt":"Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized approximations. Motivated by fluid flow-based transportation on $\\mathbb{R}^n$, however, this paper introduces an alternative definition of optimal transportation between distributions over graph vertices. This new distance still satisfies the triangle inequality but has better scaling and a connection to continuous theories of transportation. It is constructed b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06927","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":""},"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-18T01:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/nNVZNTsO3AcVrF00lcUC86oyeT2PLngCky1OB2erX5diNGQSnVji5dos1n5vhUWz69gmcaIqR6dJkqyTNxnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:17:38.759796Z"},"content_sha256":"1cc3c3fabeb2b1c1b50e2ba4ad687eddb7d313b30267122406a2e9a37a8d4c29","schema_version":"1.0","event_id":"sha256:1cc3c3fabeb2b1c1b50e2ba4ad687eddb7d313b30267122406a2e9a37a8d4c29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NQGG37C4AFMLFDUDYZECXIAU5/bundle.json","state_url":"https://pith.science/pith/4NQGG37C4AFMLFDUDYZECXIAU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NQGG37C4AFMLFDUDYZECXIAU5/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-07T17:17:38Z","links":{"resolver":"https://pith.science/pith/4NQGG37C4AFMLFDUDYZECXIAU5","bundle":"https://pith.science/pith/4NQGG37C4AFMLFDUDYZECXIAU5/bundle.json","state":"https://pith.science/pith/4NQGG37C4AFMLFDUDYZECXIAU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NQGG37C4AFMLFDUDYZECXIAU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4NQGG37C4AFMLFDUDYZECXIAU5","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":"1de2056d512a1cc6ba8ba648035d3fc7d68ae4852a4b7cb10d089ea16dc3848a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2016-03-22T19:39:18Z","title_canon_sha256":"e781cc48668558566b102ea4743c4264ba0b0dfe999ebe9689dea4a4da8b414a"},"schema_version":"1.0","source":{"id":"1603.06927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06927","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06927v1","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06927","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"4NQGG37C4AFM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4NQGG37C4AFMLFDU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4NQGG37C","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:1cc3c3fabeb2b1c1b50e2ba4ad687eddb7d313b30267122406a2e9a37a8d4c29","target":"graph","created_at":"2026-05-18T01:18:34Z","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 distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized approximations. Motivated by fluid flow-based transportation on $\\mathbb{R}^n$, however, this paper introduces an alternative definition of optimal transportation between distributions over graph vertices. This new distance still satisfies the triangle inequality but has better scaling and a connection to continuous theories of transportation. It is constructed b","authors_text":"Adrian Butscher, Justin Solomon, Leonidas Guibas, Raif Rustamov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2016-03-22T19:39:18Z","title":"Continuous-Flow Graph Transportation Distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06927","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:cb9ff14235e8c4983e33655449f130348ab85a8ff9651362dbc447ffedde5e4b","target":"record","created_at":"2026-05-18T01:18:34Z","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":"1de2056d512a1cc6ba8ba648035d3fc7d68ae4852a4b7cb10d089ea16dc3848a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2016-03-22T19:39:18Z","title_canon_sha256":"e781cc48668558566b102ea4743c4264ba0b0dfe999ebe9689dea4a4da8b414a"},"schema_version":"1.0","source":{"id":"1603.06927","kind":"arxiv","version":1}},"canonical_sha256":"e360636fe2e00ac594741e32415d00a75a2704eb459050120144ce44342b0804","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e360636fe2e00ac594741e32415d00a75a2704eb459050120144ce44342b0804","first_computed_at":"2026-05-18T01:18:34.411338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:34.411338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I7UEthaQeIB5jdprLufSSM8eLcCoNw0rmtxjw1DNdm58RfoMqcOgOK+qsVCQYSs9uX+NFwXvCQ0b8Et1z/9GCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:34.411838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb9ff14235e8c4983e33655449f130348ab85a8ff9651362dbc447ffedde5e4b","sha256:1cc3c3fabeb2b1c1b50e2ba4ad687eddb7d313b30267122406a2e9a37a8d4c29"],"state_sha256":"6793d88ffbb0e7e5432183a9b26e521d20f2ace4af4f24217e30266c290f8064"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sa4BASNAy1aRe481tYmWWX1F0T5SGBRrLm2+T+Cywa41a+FeFpJs2QPO3/lZu0RZL1VDzetfXwh6GFVJIp7XAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:17:38.763123Z","bundle_sha256":"6af1617a5e22621066a451dc79a3e0f305138642cb065903c8b125cc75811883"}}