{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RZ46U6EA27CEUPWIY7X6B6KWAE","short_pith_number":"pith:RZ46U6EA","canonical_record":{"source":{"id":"1801.02239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-07T20:01:33Z","cross_cats_sorted":[],"title_canon_sha256":"6cb8924eac9beb41786b7ab296b833adb9754f5a6a924f9b4becf4d1bef77e1c","abstract_canon_sha256":"54c6af77c3020af87d906f235871616ecce3792e5c96e568ae3fbac0bea4e992"},"schema_version":"1.0"},"canonical_sha256":"8e79ea7880d7c44a3ec8c7efe0f956013e5b50970bbc1ff0ec7eaf970c67ce59","source":{"kind":"arxiv","id":"1801.02239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02239","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02239v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02239","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"RZ46U6EA27CE","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RZ46U6EA27CEUPWI","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RZ46U6EA","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RZ46U6EA27CEUPWIY7X6B6KWAE","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-07T20:01:33Z","cross_cats_sorted":[],"title_canon_sha256":"6cb8924eac9beb41786b7ab296b833adb9754f5a6a924f9b4becf4d1bef77e1c","abstract_canon_sha256":"54c6af77c3020af87d906f235871616ecce3792e5c96e568ae3fbac0bea4e992"},"schema_version":"1.0"},"canonical_sha256":"8e79ea7880d7c44a3ec8c7efe0f956013e5b50970bbc1ff0ec7eaf970c67ce59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.564046Z","signature_b64":"Ea2ClZHTzWYdw1fWOEV6gd/xi771gwfDghc3XvaoauE06adE7yujnPjuGPINu9D4wxXBBaKXWGz6N2Cp3ZMXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e79ea7880d7c44a3ec8c7efe0f956013e5b50970bbc1ff0ec7eaf970c67ce59","last_reissued_at":"2026-05-18T00:03:56.563194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.563194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02239","source_version":2,"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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6mgOWyK3ICye7EO5AvG3pTfKjT53p/f3tuNSkn/pTN1ve+IieyRz6aYHS17NOm9xiLXPJdDDyM/Dmd/QmMHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T16:07:31.193227Z"},"content_sha256":"c35b53ac38755b8152078364f4560a3c715bb239fa12872ff58d6550b0a6409f","schema_version":"1.0","event_id":"sha256:c35b53ac38755b8152078364f4560a3c715bb239fa12872ff58d6550b0a6409f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RZ46U6EA27CEUPWIY7X6B6KWAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heuristic algorithms for the min-max edge 2-coloring problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru Popa, Radu Stefan Mincu","submitted_at":"2018-01-07T20:01:33Z","abstract_excerpt":"In multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (MC2R 2004, INFOCOM 2005) propose and study several such architectures in which a computer can have multiple network interface cards. These architectures are modeled as a graph problem named \\emph{maximum edge $q$-coloring} and studied in several papers by Feng et. al (TAMC 2007), Adamaszek and Popa (ISAAC 2010, JDA 2016). Later on Larjomaa and Popa (IWOCA 2014, JGAA 2015) define and study an alternative variant, named the \\emph{min-max edge $q$-coloring}.\n  The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02239","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"},"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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I49cDw3nxEHd/jLWg7FWt0jppwNwS71dHd0WWpWB7aIKBkbWupXyz5cS9KPXFDXOgJtMBl6rK67qlmlXbvTmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T16:07:31.193596Z"},"content_sha256":"f3dfd74fe63fb0e53669e104b2084f1635735cfe128ef1c65b60e8b131ebd3ae","schema_version":"1.0","event_id":"sha256:f3dfd74fe63fb0e53669e104b2084f1635735cfe128ef1c65b60e8b131ebd3ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZ46U6EA27CEUPWIY7X6B6KWAE/bundle.json","state_url":"https://pith.science/pith/RZ46U6EA27CEUPWIY7X6B6KWAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZ46U6EA27CEUPWIY7X6B6KWAE/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-07-03T16:07:31Z","links":{"resolver":"https://pith.science/pith/RZ46U6EA27CEUPWIY7X6B6KWAE","bundle":"https://pith.science/pith/RZ46U6EA27CEUPWIY7X6B6KWAE/bundle.json","state":"https://pith.science/pith/RZ46U6EA27CEUPWIY7X6B6KWAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZ46U6EA27CEUPWIY7X6B6KWAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RZ46U6EA27CEUPWIY7X6B6KWAE","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":"54c6af77c3020af87d906f235871616ecce3792e5c96e568ae3fbac0bea4e992","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-07T20:01:33Z","title_canon_sha256":"6cb8924eac9beb41786b7ab296b833adb9754f5a6a924f9b4becf4d1bef77e1c"},"schema_version":"1.0","source":{"id":"1801.02239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02239","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02239v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02239","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"RZ46U6EA27CE","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RZ46U6EA27CEUPWI","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RZ46U6EA","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:f3dfd74fe63fb0e53669e104b2084f1635735cfe128ef1c65b60e8b131ebd3ae","target":"graph","created_at":"2026-05-18T00:03:56Z","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":"In multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (MC2R 2004, INFOCOM 2005) propose and study several such architectures in which a computer can have multiple network interface cards. These architectures are modeled as a graph problem named \\emph{maximum edge $q$-coloring} and studied in several papers by Feng et. al (TAMC 2007), Adamaszek and Popa (ISAAC 2010, JDA 2016). Later on Larjomaa and Popa (IWOCA 2014, JGAA 2015) define and study an alternative variant, named the \\emph{min-max edge $q$-coloring}.\n  The ","authors_text":"Alexandru Popa, Radu Stefan Mincu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-07T20:01:33Z","title":"Heuristic algorithms for the min-max edge 2-coloring problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02239","kind":"arxiv","version":2},"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:c35b53ac38755b8152078364f4560a3c715bb239fa12872ff58d6550b0a6409f","target":"record","created_at":"2026-05-18T00:03:56Z","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":"54c6af77c3020af87d906f235871616ecce3792e5c96e568ae3fbac0bea4e992","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-07T20:01:33Z","title_canon_sha256":"6cb8924eac9beb41786b7ab296b833adb9754f5a6a924f9b4becf4d1bef77e1c"},"schema_version":"1.0","source":{"id":"1801.02239","kind":"arxiv","version":2}},"canonical_sha256":"8e79ea7880d7c44a3ec8c7efe0f956013e5b50970bbc1ff0ec7eaf970c67ce59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e79ea7880d7c44a3ec8c7efe0f956013e5b50970bbc1ff0ec7eaf970c67ce59","first_computed_at":"2026-05-18T00:03:56.563194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:56.563194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ea2ClZHTzWYdw1fWOEV6gd/xi771gwfDghc3XvaoauE06adE7yujnPjuGPINu9D4wxXBBaKXWGz6N2Cp3ZMXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:56.564046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c35b53ac38755b8152078364f4560a3c715bb239fa12872ff58d6550b0a6409f","sha256:f3dfd74fe63fb0e53669e104b2084f1635735cfe128ef1c65b60e8b131ebd3ae"],"state_sha256":"e7e3c2dc284bf8e7bd3740cc396e9d823bb7def67ef2affef71111b1a8d6b08d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ui6R+2KE0+OcFA5hTkNG2/PYBLmpvfnE8VrOZegmKeIyK+m544GYGSnuOTC6vVpUhe67LYCLK1ABfMtSoJUaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T16:07:31.195545Z","bundle_sha256":"8ca5d9d114074540ac8ef1445f6d80d7dab5f3f770fa43c87ff2340d7994f478"}}