{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:IUPFBC3BMKOOIZ27236B263E4K","short_pith_number":"pith:IUPFBC3B","canonical_record":{"source":{"id":"2111.00885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-11-01T12:21:30Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"4e249750815525fa44f2e92a4216c52dcc7b3a11902084c16e6a9419f8e96444","abstract_canon_sha256":"9e4d6e40cf8b5bdd228bb13cb84bd6e422de82d80820edb384d184d741cb95a7"},"schema_version":"1.0"},"canonical_sha256":"451e508b61629ce4675fd6fc1d7b64e2ac73e4c249ccf557785413795b525f72","source":{"kind":"arxiv","id":"2111.00885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.00885","created_at":"2026-07-05T03:27:50Z"},{"alias_kind":"arxiv_version","alias_value":"2111.00885v1","created_at":"2026-07-05T03:27:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00885","created_at":"2026-07-05T03:27:50Z"},{"alias_kind":"pith_short_12","alias_value":"IUPFBC3BMKOO","created_at":"2026-07-05T03:27:50Z"},{"alias_kind":"pith_short_16","alias_value":"IUPFBC3BMKOOIZ27","created_at":"2026-07-05T03:27:50Z"},{"alias_kind":"pith_short_8","alias_value":"IUPFBC3B","created_at":"2026-07-05T03:27:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:IUPFBC3BMKOOIZ27236B263E4K","target":"record","payload":{"canonical_record":{"source":{"id":"2111.00885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-11-01T12:21:30Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"4e249750815525fa44f2e92a4216c52dcc7b3a11902084c16e6a9419f8e96444","abstract_canon_sha256":"9e4d6e40cf8b5bdd228bb13cb84bd6e422de82d80820edb384d184d741cb95a7"},"schema_version":"1.0"},"canonical_sha256":"451e508b61629ce4675fd6fc1d7b64e2ac73e4c249ccf557785413795b525f72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:50.886094Z","signature_b64":"n5766kAClcijF1wlBoAEZiD+oloN1pqHAi3SvslcYCtJbrPYbbjDEivJCnh0Bin1hO8v/bYUwzl+kKaNks1iBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"451e508b61629ce4675fd6fc1d7b64e2ac73e4c249ccf557785413795b525f72","last_reissued_at":"2026-07-05T03:27:50.885689Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:50.885689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.00885","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-07-05T03:27:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FI+0PAT6GCqcKEEGDHsggOqM3G6jv4xK285IJUzSMhMVKKriOSJqwcJShVcld46RGn/QX38lJpibKC1pqtWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:51:50.851513Z"},"content_sha256":"5bda34debba49e9c1b2fedab9a0a1cca78ab7b49eaf63a0565a4569d8185f679","schema_version":"1.0","event_id":"sha256:5bda34debba49e9c1b2fedab9a0a1cca78ab7b49eaf63a0565a4569d8185f679"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:IUPFBC3BMKOOIZ27236B263E4K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Interference Minimization in Future Wireless Network Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.SI","authors_text":"Bo Bai, P\\'eter L. Erd\\H{o}s, Tam\\'as R\\'obert Mezei, Wei Han, Xiang Chen, Yiding Yu","submitted_at":"2021-11-01T12:21:30Z","abstract_excerpt":"We propose a simple and fast method for providing a high quality solution for the sum-interference minimization problem. As future networks are deployed in high density urban areas, improved clustering methods are needed to provide low interference network connectivity. The proposed algorithm applies straightforward similarity based clustering and optionally stable matchings to outperform state of the art algorithms. The running times of our algorithms are dominated by one matrix multiplication."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00885","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/2111.00885/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"},"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-07-05T03:27:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbEW5E3ootzM9v/6RqO+K4EVPQI3oBK5xQirWe3Tb3sA97wNKlmGLla4KNnRaV8ZNfrIJSXtQ8s4atxMDLr1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:51:50.852019Z"},"content_sha256":"bbe5fa8cfbe00cd63615ea81daf13b68698f6f777d6d31fda3d9caf9519da642","schema_version":"1.0","event_id":"sha256:bbe5fa8cfbe00cd63615ea81daf13b68698f6f777d6d31fda3d9caf9519da642"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUPFBC3BMKOOIZ27236B263E4K/bundle.json","state_url":"https://pith.science/pith/IUPFBC3BMKOOIZ27236B263E4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUPFBC3BMKOOIZ27236B263E4K/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-08-13T05:51:50Z","links":{"resolver":"https://pith.science/pith/IUPFBC3BMKOOIZ27236B263E4K","bundle":"https://pith.science/pith/IUPFBC3BMKOOIZ27236B263E4K/bundle.json","state":"https://pith.science/pith/IUPFBC3BMKOOIZ27236B263E4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUPFBC3BMKOOIZ27236B263E4K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:IUPFBC3BMKOOIZ27236B263E4K","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":"9e4d6e40cf8b5bdd228bb13cb84bd6e422de82d80820edb384d184d741cb95a7","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-11-01T12:21:30Z","title_canon_sha256":"4e249750815525fa44f2e92a4216c52dcc7b3a11902084c16e6a9419f8e96444"},"schema_version":"1.0","source":{"id":"2111.00885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.00885","created_at":"2026-07-05T03:27:50Z"},{"alias_kind":"arxiv_version","alias_value":"2111.00885v1","created_at":"2026-07-05T03:27:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00885","created_at":"2026-07-05T03:27:50Z"},{"alias_kind":"pith_short_12","alias_value":"IUPFBC3BMKOO","created_at":"2026-07-05T03:27:50Z"},{"alias_kind":"pith_short_16","alias_value":"IUPFBC3BMKOOIZ27","created_at":"2026-07-05T03:27:50Z"},{"alias_kind":"pith_short_8","alias_value":"IUPFBC3B","created_at":"2026-07-05T03:27:50Z"}],"graph_snapshots":[{"event_id":"sha256:bbe5fa8cfbe00cd63615ea81daf13b68698f6f777d6d31fda3d9caf9519da642","target":"graph","created_at":"2026-07-05T03:27:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.00885/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a simple and fast method for providing a high quality solution for the sum-interference minimization problem. As future networks are deployed in high density urban areas, improved clustering methods are needed to provide low interference network connectivity. The proposed algorithm applies straightforward similarity based clustering and optionally stable matchings to outperform state of the art algorithms. The running times of our algorithms are dominated by one matrix multiplication.","authors_text":"Bo Bai, P\\'eter L. Erd\\H{o}s, Tam\\'as R\\'obert Mezei, Wei Han, Xiang Chen, Yiding Yu","cross_cats":["cs.IT","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-11-01T12:21:30Z","title":"Algorithms for Interference Minimization in Future Wireless Network Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00885","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:5bda34debba49e9c1b2fedab9a0a1cca78ab7b49eaf63a0565a4569d8185f679","target":"record","created_at":"2026-07-05T03:27:50Z","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":"9e4d6e40cf8b5bdd228bb13cb84bd6e422de82d80820edb384d184d741cb95a7","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-11-01T12:21:30Z","title_canon_sha256":"4e249750815525fa44f2e92a4216c52dcc7b3a11902084c16e6a9419f8e96444"},"schema_version":"1.0","source":{"id":"2111.00885","kind":"arxiv","version":1}},"canonical_sha256":"451e508b61629ce4675fd6fc1d7b64e2ac73e4c249ccf557785413795b525f72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"451e508b61629ce4675fd6fc1d7b64e2ac73e4c249ccf557785413795b525f72","first_computed_at":"2026-07-05T03:27:50.885689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:27:50.885689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n5766kAClcijF1wlBoAEZiD+oloN1pqHAi3SvslcYCtJbrPYbbjDEivJCnh0Bin1hO8v/bYUwzl+kKaNks1iBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:27:50.886094Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.00885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bda34debba49e9c1b2fedab9a0a1cca78ab7b49eaf63a0565a4569d8185f679","sha256:bbe5fa8cfbe00cd63615ea81daf13b68698f6f777d6d31fda3d9caf9519da642"],"state_sha256":"fd3d6c019baffd4396d2837ac6fe274d9758ac406e30ceee4a454b309ef5e83f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UHGtNkGfVPGfas7QL/mMy9bEZKdimCa89LkA/meSGZ9ZC3sDXSq6uGdHgnNgZX1n2afms0xOfpHrQVpK3jElAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T05:51:50.857364Z","bundle_sha256":"b59e3a278dd2922b8210efc3753144834bb171abce7e72a71f49c7f24eff25cc"}}