{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NROGPF5PJ7P3CWWLQW3LMONM4J","short_pith_number":"pith:NROGPF5P","schema_version":"1.0","canonical_sha256":"6c5c6797af4fdfb15acb85b6b639ace273d26d38f075f6bfb7e04c7d91d3008c","source":{"kind":"arxiv","id":"1801.03190","version":1},"attestation_state":"computed","paper":{"title":"Risk-Averse Matchings over Uncertain Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DM","cs.SI"],"primary_cat":"cs.DS","authors_text":"Charalampos E. Tsourakakis, Johnson Lam, Liu Yang, Shreyas Sekar","submitted_at":"2018-01-09T23:41:28Z","abstract_excerpt":"A large number of applications such as querying sensor networks, and analyzing protein-protein interaction (PPI) networks, rely on mining uncertain graph and hypergraph databases. In this work we study the following problem: given an uncertain, weighted (hyper)graph, how can we efficiently find a (hyper)matching with high expected reward, and low risk?\n  This problem naturally arises in the context of several important applications, such as online dating, kidney exchanges, and team formation. We introduce a novel formulation for finding matchings with maximum expected reward and bounded risk u"},"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":"1801.03190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-09T23:41:28Z","cross_cats_sorted":["cs.DB","cs.DM","cs.SI"],"title_canon_sha256":"c828e628eb764a7ea9c38c15f0da01587d6865096e5c93ce86b7598bae79461b","abstract_canon_sha256":"3d19a23a2ee46dc82e0c333ce4d479540d54a7fd2b82db827812a952e6905267"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:18.795424Z","signature_b64":"ZQWWGQd/OwLXXYihQxkA/f/aanTzuEJZ28Ljb5Mx/CBjZMC9r/+KhKu9vodDskJdNczl7k6MEpGT2DkY+XZWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c5c6797af4fdfb15acb85b6b639ace273d26d38f075f6bfb7e04c7d91d3008c","last_reissued_at":"2026-05-18T00:26:18.794853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:18.794853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Risk-Averse Matchings over Uncertain Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DM","cs.SI"],"primary_cat":"cs.DS","authors_text":"Charalampos E. Tsourakakis, Johnson Lam, Liu Yang, Shreyas Sekar","submitted_at":"2018-01-09T23:41:28Z","abstract_excerpt":"A large number of applications such as querying sensor networks, and analyzing protein-protein interaction (PPI) networks, rely on mining uncertain graph and hypergraph databases. In this work we study the following problem: given an uncertain, weighted (hyper)graph, how can we efficiently find a (hyper)matching with high expected reward, and low risk?\n  This problem naturally arises in the context of several important applications, such as online dating, kidney exchanges, and team formation. We introduce a novel formulation for finding matchings with maximum expected reward and bounded risk u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03190","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.03190","created_at":"2026-05-18T00:26:18.794918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03190v1","created_at":"2026-05-18T00:26:18.794918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03190","created_at":"2026-05-18T00:26:18.794918+00:00"},{"alias_kind":"pith_short_12","alias_value":"NROGPF5PJ7P3","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NROGPF5PJ7P3CWWL","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NROGPF5P","created_at":"2026-05-18T12:32:40.477152+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/NROGPF5PJ7P3CWWLQW3LMONM4J","json":"https://pith.science/pith/NROGPF5PJ7P3CWWLQW3LMONM4J.json","graph_json":"https://pith.science/api/pith-number/NROGPF5PJ7P3CWWLQW3LMONM4J/graph.json","events_json":"https://pith.science/api/pith-number/NROGPF5PJ7P3CWWLQW3LMONM4J/events.json","paper":"https://pith.science/paper/NROGPF5P"},"agent_actions":{"view_html":"https://pith.science/pith/NROGPF5PJ7P3CWWLQW3LMONM4J","download_json":"https://pith.science/pith/NROGPF5PJ7P3CWWLQW3LMONM4J.json","view_paper":"https://pith.science/paper/NROGPF5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03190&json=true","fetch_graph":"https://pith.science/api/pith-number/NROGPF5PJ7P3CWWLQW3LMONM4J/graph.json","fetch_events":"https://pith.science/api/pith-number/NROGPF5PJ7P3CWWLQW3LMONM4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NROGPF5PJ7P3CWWLQW3LMONM4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NROGPF5PJ7P3CWWLQW3LMONM4J/action/storage_attestation","attest_author":"https://pith.science/pith/NROGPF5PJ7P3CWWLQW3LMONM4J/action/author_attestation","sign_citation":"https://pith.science/pith/NROGPF5PJ7P3CWWLQW3LMONM4J/action/citation_signature","submit_replication":"https://pith.science/pith/NROGPF5PJ7P3CWWLQW3LMONM4J/action/replication_record"}},"created_at":"2026-05-18T00:26:18.794918+00:00","updated_at":"2026-05-18T00:26:18.794918+00:00"}