{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OUUSWDCOQNBDZVIFEJ7UGBRVAM","short_pith_number":"pith:OUUSWDCO","canonical_record":{"source":{"id":"1603.06002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-18T21:26:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5ffff19dae82971def1fc21c978b78b963d97ab041424abe1f60a9ccae9c14a8","abstract_canon_sha256":"22d6b5ad1d813126ec7c97c7b46dda77041a7d36e0493cee67bcbfee5e3a2c43"},"schema_version":"1.0"},"canonical_sha256":"75292b0c4e83423cd505227f430635030583bc747fbaad2919d850b46a78ae2e","source":{"kind":"arxiv","id":"1603.06002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06002","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06002v1","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06002","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"OUUSWDCOQNBD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OUUSWDCOQNBDZVIF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OUUSWDCO","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OUUSWDCOQNBDZVIFEJ7UGBRVAM","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-18T21:26:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5ffff19dae82971def1fc21c978b78b963d97ab041424abe1f60a9ccae9c14a8","abstract_canon_sha256":"22d6b5ad1d813126ec7c97c7b46dda77041a7d36e0493cee67bcbfee5e3a2c43"},"schema_version":"1.0"},"canonical_sha256":"75292b0c4e83423cd505227f430635030583bc747fbaad2919d850b46a78ae2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:52.023515Z","signature_b64":"fWycCjGmWc51kJdhhnXNdu5AcwGQ4LDhFT9dF8TYWzGMQjOE4yVtNzK/9OHkNII8rzy0ajr7NWCS9osLkBiJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75292b0c4e83423cd505227f430635030583bc747fbaad2919d850b46a78ae2e","last_reissued_at":"2026-05-18T01:18:52.022901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:52.022901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06002","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:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W4sS5nUBy0FlXM/AdAua565ZkyyItEA1jtjpLCylq8fK7xDIRG4qnAu1/CYMquLUEKGewc3nPphrLYYBW2XjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:54:00.416522Z"},"content_sha256":"b3c8a3b82038a368342ac116636595f76b26f76a7af5a5cb7e251d22f5e8aa0c","schema_version":"1.0","event_id":"sha256:b3c8a3b82038a368342ac116636595f76b26f76a7af5a5cb7e251d22f5e8aa0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OUUSWDCOQNBDZVIFEJ7UGBRVAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Message Passing Algorithm for the Problem of Path Packing in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DS","authors_text":"David Gamarnik, Patrick Eschenfeldt","submitted_at":"2016-03-18T21:26:59Z","abstract_excerpt":"We consider the problem of packing node-disjoint directed paths in a directed graph. We consider a variant of this problem where each path starts within a fixed subset of root nodes, subject to a given bound on the length of paths. This problem is motivated by the so-called kidney exchange problem, but has potential other applications and is interesting in its own right.\n  We propose a new algorithm for this problem based on the message passing/belief propagation technique. A priori this problem does not have an associated graphical model, so in order to apply a belief propagation algorithm we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06002","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:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+yadeEL+WfOpmjL21RwyJFPf8Ozt7HCNAmLRmd31iMVTRi2Mhplci4GQpxKTGmiXyjlhDU3YAJMAAqq9axxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:54:00.417229Z"},"content_sha256":"acc60940156caec2c7bd26a2f05d49e5699313d8e27b78b62df720df19dc74e5","schema_version":"1.0","event_id":"sha256:acc60940156caec2c7bd26a2f05d49e5699313d8e27b78b62df720df19dc74e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUUSWDCOQNBDZVIFEJ7UGBRVAM/bundle.json","state_url":"https://pith.science/pith/OUUSWDCOQNBDZVIFEJ7UGBRVAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUUSWDCOQNBDZVIFEJ7UGBRVAM/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-11T19:54:00Z","links":{"resolver":"https://pith.science/pith/OUUSWDCOQNBDZVIFEJ7UGBRVAM","bundle":"https://pith.science/pith/OUUSWDCOQNBDZVIFEJ7UGBRVAM/bundle.json","state":"https://pith.science/pith/OUUSWDCOQNBDZVIFEJ7UGBRVAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUUSWDCOQNBDZVIFEJ7UGBRVAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OUUSWDCOQNBDZVIFEJ7UGBRVAM","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":"22d6b5ad1d813126ec7c97c7b46dda77041a7d36e0493cee67bcbfee5e3a2c43","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-18T21:26:59Z","title_canon_sha256":"5ffff19dae82971def1fc21c978b78b963d97ab041424abe1f60a9ccae9c14a8"},"schema_version":"1.0","source":{"id":"1603.06002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06002","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06002v1","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06002","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"OUUSWDCOQNBD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OUUSWDCOQNBDZVIF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OUUSWDCO","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:acc60940156caec2c7bd26a2f05d49e5699313d8e27b78b62df720df19dc74e5","target":"graph","created_at":"2026-05-18T01:18:52Z","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":"We consider the problem of packing node-disjoint directed paths in a directed graph. We consider a variant of this problem where each path starts within a fixed subset of root nodes, subject to a given bound on the length of paths. This problem is motivated by the so-called kidney exchange problem, but has potential other applications and is interesting in its own right.\n  We propose a new algorithm for this problem based on the message passing/belief propagation technique. A priori this problem does not have an associated graphical model, so in order to apply a belief propagation algorithm we","authors_text":"David Gamarnik, Patrick Eschenfeldt","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-18T21:26:59Z","title":"A Message Passing Algorithm for the Problem of Path Packing in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06002","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:b3c8a3b82038a368342ac116636595f76b26f76a7af5a5cb7e251d22f5e8aa0c","target":"record","created_at":"2026-05-18T01:18:52Z","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":"22d6b5ad1d813126ec7c97c7b46dda77041a7d36e0493cee67bcbfee5e3a2c43","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-18T21:26:59Z","title_canon_sha256":"5ffff19dae82971def1fc21c978b78b963d97ab041424abe1f60a9ccae9c14a8"},"schema_version":"1.0","source":{"id":"1603.06002","kind":"arxiv","version":1}},"canonical_sha256":"75292b0c4e83423cd505227f430635030583bc747fbaad2919d850b46a78ae2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75292b0c4e83423cd505227f430635030583bc747fbaad2919d850b46a78ae2e","first_computed_at":"2026-05-18T01:18:52.022901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:52.022901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fWycCjGmWc51kJdhhnXNdu5AcwGQ4LDhFT9dF8TYWzGMQjOE4yVtNzK/9OHkNII8rzy0ajr7NWCS9osLkBiJDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:52.023515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3c8a3b82038a368342ac116636595f76b26f76a7af5a5cb7e251d22f5e8aa0c","sha256:acc60940156caec2c7bd26a2f05d49e5699313d8e27b78b62df720df19dc74e5"],"state_sha256":"581832b8ac9dcf92b20a4dc9da482981a6be1e01011d88dec813df532b29e714"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OfCiv2jYWFs9HrLpednh6nUtmdGKYpT+vslXci2wA759BM1AMoTMF4EEFMv6UajlraA8DPgmQUlZpus4PFBeAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:54:00.421076Z","bundle_sha256":"4630a4c06abc58b01b85f21860bfab5a25d0eff2179e4dbcfbff0dd393c000c8"}}