{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3NFG25OBG7ZZZAE4NMW7ZCCJIF","short_pith_number":"pith:3NFG25OB","canonical_record":{"source":{"id":"1208.0811","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-03T18:26:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b44fb93441d08d03b8b46d8cb7e3aa16e5ad132c74e1b955e41fdb8713219e64","abstract_canon_sha256":"a5ada676d60ea4ed21a9f998f0d83ffebe75d642ff2ad9ee7b0ed32cb9ef8dd0"},"schema_version":"1.0"},"canonical_sha256":"db4a6d75c137f39c809c6b2dfc884941506c6327e506f81ae0b57dbd97ff6548","source":{"kind":"arxiv","id":"1208.0811","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0811","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0811v2","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0811","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"3NFG25OBG7ZZ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3NFG25OBG7ZZZAE4","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3NFG25OB","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3NFG25OBG7ZZZAE4NMW7ZCCJIF","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0811","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-03T18:26:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b44fb93441d08d03b8b46d8cb7e3aa16e5ad132c74e1b955e41fdb8713219e64","abstract_canon_sha256":"a5ada676d60ea4ed21a9f998f0d83ffebe75d642ff2ad9ee7b0ed32cb9ef8dd0"},"schema_version":"1.0"},"canonical_sha256":"db4a6d75c137f39c809c6b2dfc884941506c6327e506f81ae0b57dbd97ff6548","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:38.409748Z","signature_b64":"5vliYQrgtbaRer3E4EuFCmrpBGq1GvXtnphqJtiAtCFgsQ2lAZiVhTMieJWF+JuvUFFIaaHZajOjVdx+tusNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db4a6d75c137f39c809c6b2dfc884941506c6327e506f81ae0b57dbd97ff6548","last_reissued_at":"2026-05-18T03:40:38.409066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:38.409066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0811","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-18T03:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n2EkPGZ3e9DpabCdDEebt2BIohxabzRQUiKriTftBZk7Ch0qlIVXkJDaWuf5IS2/+CaiA2ln4AMZ5E/LRjGDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:19:20.904142Z"},"content_sha256":"700fd1a89d0fda6d3f4cd15e7632a387b02b8254e1b912d1ca09028e74ddbc19","schema_version":"1.0","event_id":"sha256:700fd1a89d0fda6d3f4cd15e7632a387b02b8254e1b912d1ca09028e74ddbc19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3NFG25OBG7ZZZAE4NMW7ZCCJIF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Maximum Link Scheduling in Distributed Computing Models with SINR Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Anil Kumar S. Vullikanti, Guanhong Pei","submitted_at":"2012-08-03T18:26:06Z","abstract_excerpt":"A fundamental problem in wireless networks is the maximum link scheduling problem: given a set $L$ of links, compute the largest possible subset $L'\\subseteq L$ of links that can be scheduled simultaneously without interference. This problem is particularly challenging in the physical interference model based on SINR constraints (referred to as the SINR model), which has gained a lot of interest in recent years. Constant factor approximation algorithms have been developed for this problem, but low complexity distributed algorithms that give the same approximation guarantee in the SINR model ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0811","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-18T03:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXVf8nqJ96ovFQUABUtCe/eK7JwxsIUedFRO3+EsnNWMVMdHjtiVa4gTPMBhByrsvXvU2cYqkG1I/t3dBbONDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:19:20.904525Z"},"content_sha256":"06a7b5c6e8c6b49fc7d88b6ecdaa3715bb1c32c11b51fd6f782c7a11766b5efc","schema_version":"1.0","event_id":"sha256:06a7b5c6e8c6b49fc7d88b6ecdaa3715bb1c32c11b51fd6f782c7a11766b5efc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NFG25OBG7ZZZAE4NMW7ZCCJIF/bundle.json","state_url":"https://pith.science/pith/3NFG25OBG7ZZZAE4NMW7ZCCJIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NFG25OBG7ZZZAE4NMW7ZCCJIF/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-01T07:19:20Z","links":{"resolver":"https://pith.science/pith/3NFG25OBG7ZZZAE4NMW7ZCCJIF","bundle":"https://pith.science/pith/3NFG25OBG7ZZZAE4NMW7ZCCJIF/bundle.json","state":"https://pith.science/pith/3NFG25OBG7ZZZAE4NMW7ZCCJIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NFG25OBG7ZZZAE4NMW7ZCCJIF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3NFG25OBG7ZZZAE4NMW7ZCCJIF","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":"a5ada676d60ea4ed21a9f998f0d83ffebe75d642ff2ad9ee7b0ed32cb9ef8dd0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-03T18:26:06Z","title_canon_sha256":"b44fb93441d08d03b8b46d8cb7e3aa16e5ad132c74e1b955e41fdb8713219e64"},"schema_version":"1.0","source":{"id":"1208.0811","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0811","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0811v2","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0811","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"3NFG25OBG7ZZ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3NFG25OBG7ZZZAE4","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3NFG25OB","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:06a7b5c6e8c6b49fc7d88b6ecdaa3715bb1c32c11b51fd6f782c7a11766b5efc","target":"graph","created_at":"2026-05-18T03:40:38Z","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":"A fundamental problem in wireless networks is the maximum link scheduling problem: given a set $L$ of links, compute the largest possible subset $L'\\subseteq L$ of links that can be scheduled simultaneously without interference. This problem is particularly challenging in the physical interference model based on SINR constraints (referred to as the SINR model), which has gained a lot of interest in recent years. Constant factor approximation algorithms have been developed for this problem, but low complexity distributed algorithms that give the same approximation guarantee in the SINR model ar","authors_text":"Anil Kumar S. Vullikanti, Guanhong Pei","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-03T18:26:06Z","title":"Efficient Algorithms for Maximum Link Scheduling in Distributed Computing Models with SINR Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0811","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:700fd1a89d0fda6d3f4cd15e7632a387b02b8254e1b912d1ca09028e74ddbc19","target":"record","created_at":"2026-05-18T03:40:38Z","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":"a5ada676d60ea4ed21a9f998f0d83ffebe75d642ff2ad9ee7b0ed32cb9ef8dd0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-03T18:26:06Z","title_canon_sha256":"b44fb93441d08d03b8b46d8cb7e3aa16e5ad132c74e1b955e41fdb8713219e64"},"schema_version":"1.0","source":{"id":"1208.0811","kind":"arxiv","version":2}},"canonical_sha256":"db4a6d75c137f39c809c6b2dfc884941506c6327e506f81ae0b57dbd97ff6548","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db4a6d75c137f39c809c6b2dfc884941506c6327e506f81ae0b57dbd97ff6548","first_computed_at":"2026-05-18T03:40:38.409066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:38.409066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5vliYQrgtbaRer3E4EuFCmrpBGq1GvXtnphqJtiAtCFgsQ2lAZiVhTMieJWF+JuvUFFIaaHZajOjVdx+tusNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:38.409748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0811","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:700fd1a89d0fda6d3f4cd15e7632a387b02b8254e1b912d1ca09028e74ddbc19","sha256:06a7b5c6e8c6b49fc7d88b6ecdaa3715bb1c32c11b51fd6f782c7a11766b5efc"],"state_sha256":"6ec94f3294a7d7b7ce680406f90d13b7c420d0d19370cfdd4a00558be86f2a38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nlt6er8lCekysd+hEh6fx6ntiGwS0tW4hx0OnCvphl6QD5IchTKMt7rWNEZ8DVmFUnmknB9S+435/i4UDbQ8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T07:19:20.907080Z","bundle_sha256":"5ad101efaf426145845c77f654c9c3533287dbf9e76d2ffdc7798f3f3631dbc3"}}