{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UNHY4VSPF3Y5GCECC2BRKY5Y5U","short_pith_number":"pith:UNHY4VSP","schema_version":"1.0","canonical_sha256":"a34f8e564f2ef1d3088216831563b8ed1c209dcbfcb70b62d8e137b13b65bc9d","source":{"kind":"arxiv","id":"1904.00549","version":2},"attestation_state":"computed","paper":{"title":"MESH: A Flexible Distributed Hypergraph Processing System","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abhishek Chandra, Benjamin Heintz, Corey Tesdahl, Gaurav Khandelwal, Rankyung Hong, Shivangi Singh","submitted_at":"2019-04-01T03:44:36Z","abstract_excerpt":"With the rapid growth of large online social networks, the ability to analyze large-scale social structure and behavior has become critically important, and this has led to the development of several scalable graph processing systems. In reality, however, social interaction takes place not only between pairs of individuals as in the graph model, but rather in the context of multi-user groups. Research has shown that such group dynamics can be better modeled through a more general hypergraph model, resulting in the need to build scalable hypergraph processing systems. In this paper, we present "},"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":"1904.00549","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2019-04-01T03:44:36Z","cross_cats_sorted":[],"title_canon_sha256":"f25d837b836d16468d70d4e894bace2adf617e9dbc70f69c76e81f22c506d1b6","abstract_canon_sha256":"309c7cffc2bb5cc8eb7cdddc0a669c564c22078385bf31d38e10f010d7a686c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:28.648075Z","signature_b64":"w3ZN7lOdX1051Zsm+nR2fGBq4gqmDBGKM3NwYuHm2IfAxsDwx1c+TbRN14MeadILjBCyawT83CVOBc4vTgSgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a34f8e564f2ef1d3088216831563b8ed1c209dcbfcb70b62d8e137b13b65bc9d","last_reissued_at":"2026-05-17T23:46:28.647462Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:28.647462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MESH: A Flexible Distributed Hypergraph Processing System","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abhishek Chandra, Benjamin Heintz, Corey Tesdahl, Gaurav Khandelwal, Rankyung Hong, Shivangi Singh","submitted_at":"2019-04-01T03:44:36Z","abstract_excerpt":"With the rapid growth of large online social networks, the ability to analyze large-scale social structure and behavior has become critically important, and this has led to the development of several scalable graph processing systems. In reality, however, social interaction takes place not only between pairs of individuals as in the graph model, but rather in the context of multi-user groups. Research has shown that such group dynamics can be better modeled through a more general hypergraph model, resulting in the need to build scalable hypergraph processing systems. In this paper, we present "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00549","kind":"arxiv","version":2},"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":"1904.00549","created_at":"2026-05-17T23:46:28.647547+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.00549v2","created_at":"2026-05-17T23:46:28.647547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00549","created_at":"2026-05-17T23:46:28.647547+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNHY4VSPF3Y5","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNHY4VSPF3Y5GCEC","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNHY4VSP","created_at":"2026-05-18T12:33:30.264802+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/UNHY4VSPF3Y5GCECC2BRKY5Y5U","json":"https://pith.science/pith/UNHY4VSPF3Y5GCECC2BRKY5Y5U.json","graph_json":"https://pith.science/api/pith-number/UNHY4VSPF3Y5GCECC2BRKY5Y5U/graph.json","events_json":"https://pith.science/api/pith-number/UNHY4VSPF3Y5GCECC2BRKY5Y5U/events.json","paper":"https://pith.science/paper/UNHY4VSP"},"agent_actions":{"view_html":"https://pith.science/pith/UNHY4VSPF3Y5GCECC2BRKY5Y5U","download_json":"https://pith.science/pith/UNHY4VSPF3Y5GCECC2BRKY5Y5U.json","view_paper":"https://pith.science/paper/UNHY4VSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.00549&json=true","fetch_graph":"https://pith.science/api/pith-number/UNHY4VSPF3Y5GCECC2BRKY5Y5U/graph.json","fetch_events":"https://pith.science/api/pith-number/UNHY4VSPF3Y5GCECC2BRKY5Y5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNHY4VSPF3Y5GCECC2BRKY5Y5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNHY4VSPF3Y5GCECC2BRKY5Y5U/action/storage_attestation","attest_author":"https://pith.science/pith/UNHY4VSPF3Y5GCECC2BRKY5Y5U/action/author_attestation","sign_citation":"https://pith.science/pith/UNHY4VSPF3Y5GCECC2BRKY5Y5U/action/citation_signature","submit_replication":"https://pith.science/pith/UNHY4VSPF3Y5GCECC2BRKY5Y5U/action/replication_record"}},"created_at":"2026-05-17T23:46:28.647547+00:00","updated_at":"2026-05-17T23:46:28.647547+00:00"}