{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HNFO56CYRC7V7JACOBPARXIXM3","short_pith_number":"pith:HNFO56CY","canonical_record":{"source":{"id":"1905.07451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T19:30:42Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"8e1e86753a00d3497a4727d04d62decea01aa9345d5854f60d24c7cabadb9965","abstract_canon_sha256":"f9cdf2e64a43195e3db743b1908ffe3b9af32969de0e53af678b7c50c753f637"},"schema_version":"1.0"},"canonical_sha256":"3b4aeef85888bf5fa402705e08dd1766fe20af22688b5af64486ab11f7a28e48","source":{"kind":"arxiv","id":"1905.07451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07451","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07451v1","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07451","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"pith_short_12","alias_value":"HNFO56CYRC7V","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HNFO56CYRC7V7JAC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HNFO56CY","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HNFO56CYRC7V7JACOBPARXIXM3","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T19:30:42Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"8e1e86753a00d3497a4727d04d62decea01aa9345d5854f60d24c7cabadb9965","abstract_canon_sha256":"f9cdf2e64a43195e3db743b1908ffe3b9af32969de0e53af678b7c50c753f637"},"schema_version":"1.0"},"canonical_sha256":"3b4aeef85888bf5fa402705e08dd1766fe20af22688b5af64486ab11f7a28e48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:51.331914Z","signature_b64":"LKRON7oudeYM4VjZ4llHzFvWuYPLHilNE4gR+vt0C9HE/blX6eLbVUQvRN/mzgd4Zwv7fnyk3aPNCQdkOac9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b4aeef85888bf5fa402705e08dd1766fe20af22688b5af64486ab11f7a28e48","last_reissued_at":"2026-05-17T23:45:51.331414Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:51.331414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07451","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-17T23:45:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59nxDM/xKhH8MmpNA5385++Ujs7kU5ONjDQri5X4kXnM/9umDWBhfyrPgC3x8QbEzR3tIRHAR/PxKbNA6GoZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:42:54.763490Z"},"content_sha256":"59bb59a9bdf29a494289793ab601328a3087122f50a1905683a1f9b3fc77c739","schema_version":"1.0","event_id":"sha256:59bb59a9bdf29a494289793ab601328a3087122f50a1905683a1f9b3fc77c739"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HNFO56CYRC7V7JACOBPARXIXM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-based Semi-Supervised & Active Learning for Edge Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Austin R. Benson, Junteng Jia, Michael T. Schaub, Santiago Segarra","submitted_at":"2019-05-17T19:30:42Z","abstract_excerpt":"We present a graph-based semi-supervised learning (SSL) method for learning edge flows defined on a graph. Specifically, given flow measurements on a subset of edges, we want to predict the flows on the remaining edges. To this end, we develop a computational framework that imposes certain constraints on the overall flows, such as (approximate) flow conservation. These constraints render our approach different from classical graph-based SSL for vertex labels, which posits that tightly connected nodes share similar labels and leverages the graph structure accordingly to extrapolate from a few v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07451","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-17T23:45:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1K7T1Fa3k1QYChqHitZr6f1Z7JxlFOUzoLg+tCY67pXPnfn8Wu91DGSRLW+wh1AHbkgEPjQ0AxQRWaGv9UgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:42:54.763858Z"},"content_sha256":"087ea1a930718a796c998b8b5a476d393696fb46818c832e253db34e31a594ec","schema_version":"1.0","event_id":"sha256:087ea1a930718a796c998b8b5a476d393696fb46818c832e253db34e31a594ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNFO56CYRC7V7JACOBPARXIXM3/bundle.json","state_url":"https://pith.science/pith/HNFO56CYRC7V7JACOBPARXIXM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNFO56CYRC7V7JACOBPARXIXM3/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-01T20:42:54Z","links":{"resolver":"https://pith.science/pith/HNFO56CYRC7V7JACOBPARXIXM3","bundle":"https://pith.science/pith/HNFO56CYRC7V7JACOBPARXIXM3/bundle.json","state":"https://pith.science/pith/HNFO56CYRC7V7JACOBPARXIXM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNFO56CYRC7V7JACOBPARXIXM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HNFO56CYRC7V7JACOBPARXIXM3","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":"f9cdf2e64a43195e3db743b1908ffe3b9af32969de0e53af678b7c50c753f637","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T19:30:42Z","title_canon_sha256":"8e1e86753a00d3497a4727d04d62decea01aa9345d5854f60d24c7cabadb9965"},"schema_version":"1.0","source":{"id":"1905.07451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07451","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07451v1","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07451","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"pith_short_12","alias_value":"HNFO56CYRC7V","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HNFO56CYRC7V7JAC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HNFO56CY","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:087ea1a930718a796c998b8b5a476d393696fb46818c832e253db34e31a594ec","target":"graph","created_at":"2026-05-17T23:45:51Z","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 present a graph-based semi-supervised learning (SSL) method for learning edge flows defined on a graph. Specifically, given flow measurements on a subset of edges, we want to predict the flows on the remaining edges. To this end, we develop a computational framework that imposes certain constraints on the overall flows, such as (approximate) flow conservation. These constraints render our approach different from classical graph-based SSL for vertex labels, which posits that tightly connected nodes share similar labels and leverages the graph structure accordingly to extrapolate from a few v","authors_text":"Austin R. Benson, Junteng Jia, Michael T. Schaub, Santiago Segarra","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T19:30:42Z","title":"Graph-based Semi-Supervised & Active Learning for Edge Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07451","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:59bb59a9bdf29a494289793ab601328a3087122f50a1905683a1f9b3fc77c739","target":"record","created_at":"2026-05-17T23:45:51Z","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":"f9cdf2e64a43195e3db743b1908ffe3b9af32969de0e53af678b7c50c753f637","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T19:30:42Z","title_canon_sha256":"8e1e86753a00d3497a4727d04d62decea01aa9345d5854f60d24c7cabadb9965"},"schema_version":"1.0","source":{"id":"1905.07451","kind":"arxiv","version":1}},"canonical_sha256":"3b4aeef85888bf5fa402705e08dd1766fe20af22688b5af64486ab11f7a28e48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b4aeef85888bf5fa402705e08dd1766fe20af22688b5af64486ab11f7a28e48","first_computed_at":"2026-05-17T23:45:51.331414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:51.331414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LKRON7oudeYM4VjZ4llHzFvWuYPLHilNE4gR+vt0C9HE/blX6eLbVUQvRN/mzgd4Zwv7fnyk3aPNCQdkOac9Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:51.331914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59bb59a9bdf29a494289793ab601328a3087122f50a1905683a1f9b3fc77c739","sha256:087ea1a930718a796c998b8b5a476d393696fb46818c832e253db34e31a594ec"],"state_sha256":"a832a18410cd84b2a6339911bd5e3719e1fb7bcd6d90ac55fe9ec92d4a183ee5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRHs8nz7eHOS0/fVBmeSb60CZS3Z4HWWThTIcUpkg7Es25GJhlEzVCZ85sWhSCLT+j44R80PLVFQypfJDN1qCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:42:54.765844Z","bundle_sha256":"eb4bae6173d34d97cd2a4ecf2de785e0900410c6ed03127cf6533dd89abafcac"}}