{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZJ5LF5I5IRVEYSMPAU3PPEWMJI","short_pith_number":"pith:ZJ5LF5I5","schema_version":"1.0","canonical_sha256":"ca7ab2f51d446a4c498f0536f792cc4a02c786ecb0a8dac4f3ef4a6cd9ac45f6","source":{"kind":"arxiv","id":"2103.05394","version":1},"attestation_state":"computed","paper":{"title":"Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Berkay Demireller, Bora U\\c{c}ar, Fatih Ta\\c{s}yaran, Kamer Kaya","submitted_at":"2021-03-09T12:33:57Z","abstract_excerpt":"Many well-known, real-world problems involve dynamic data which describe the relationship among the entities. Hypergraphs are powerful combinatorial structures that are frequently used to model such data. For many of today's data-centric applications, this data is streaming; new items arrive continuously, and the data grows with time. With paradigms such as Internet of Things and Edge Computing, such applications become more natural and more practical. In this work, we assume a streaming model where the data is modeled as a hypergraph, which is generated at the edge. This data then partitioned"},"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":"2103.05394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-03-09T12:33:57Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"245ccac042e795a89b2bbbc71c2935646f73d5ea70c1e717ca5c904ec831b2f0","abstract_canon_sha256":"687a3b6ea7b486d511f9297d26c98d80bcbdaff830b11c6725385eec2cefb831"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:21:25.664231Z","signature_b64":"CqvyFkzmQWmQb/ADL5AcrdmiawJj317xzZt76zZPaWrSJa4ciZ3Ol3jS33TcN+SvssLxcifP96YeOeLAPYl7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca7ab2f51d446a4c498f0536f792cc4a02c786ecb0a8dac4f3ef4a6cd9ac45f6","last_reissued_at":"2026-07-05T02:21:25.663738Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:21:25.663738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Berkay Demireller, Bora U\\c{c}ar, Fatih Ta\\c{s}yaran, Kamer Kaya","submitted_at":"2021-03-09T12:33:57Z","abstract_excerpt":"Many well-known, real-world problems involve dynamic data which describe the relationship among the entities. Hypergraphs are powerful combinatorial structures that are frequently used to model such data. For many of today's data-centric applications, this data is streaming; new items arrive continuously, and the data grows with time. With paradigms such as Internet of Things and Edge Computing, such applications become more natural and more practical. In this work, we assume a streaming model where the data is modeled as a hypergraph, which is generated at the edge. This data then partitioned"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.05394","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.05394/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2103.05394","created_at":"2026-07-05T02:21:25.663813+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.05394v1","created_at":"2026-07-05T02:21:25.663813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.05394","created_at":"2026-07-05T02:21:25.663813+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJ5LF5I5IRVE","created_at":"2026-07-05T02:21:25.663813+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJ5LF5I5IRVEYSMP","created_at":"2026-07-05T02:21:25.663813+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJ5LF5I5","created_at":"2026-07-05T02:21:25.663813+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00674","citing_title":"Triangle Counting in Hypergraph Streams: A Complete and Practical Approach","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZJ5LF5I5IRVEYSMPAU3PPEWMJI","json":"https://pith.science/pith/ZJ5LF5I5IRVEYSMPAU3PPEWMJI.json","graph_json":"https://pith.science/api/pith-number/ZJ5LF5I5IRVEYSMPAU3PPEWMJI/graph.json","events_json":"https://pith.science/api/pith-number/ZJ5LF5I5IRVEYSMPAU3PPEWMJI/events.json","paper":"https://pith.science/paper/ZJ5LF5I5"},"agent_actions":{"view_html":"https://pith.science/pith/ZJ5LF5I5IRVEYSMPAU3PPEWMJI","download_json":"https://pith.science/pith/ZJ5LF5I5IRVEYSMPAU3PPEWMJI.json","view_paper":"https://pith.science/paper/ZJ5LF5I5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.05394&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJ5LF5I5IRVEYSMPAU3PPEWMJI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJ5LF5I5IRVEYSMPAU3PPEWMJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJ5LF5I5IRVEYSMPAU3PPEWMJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJ5LF5I5IRVEYSMPAU3PPEWMJI/action/storage_attestation","attest_author":"https://pith.science/pith/ZJ5LF5I5IRVEYSMPAU3PPEWMJI/action/author_attestation","sign_citation":"https://pith.science/pith/ZJ5LF5I5IRVEYSMPAU3PPEWMJI/action/citation_signature","submit_replication":"https://pith.science/pith/ZJ5LF5I5IRVEYSMPAU3PPEWMJI/action/replication_record"}},"created_at":"2026-07-05T02:21:25.663813+00:00","updated_at":"2026-07-05T02:21:25.663813+00:00"}