{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:S2AULCSIRMF7KDSK7H4Z3X3UV6","short_pith_number":"pith:S2AULCSI","canonical_record":{"source":{"id":"1203.2725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-13T07:34:27Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"31516045e1af77feff355c96d6be150eeb792d7652824abd37ef490fb27ab96d","abstract_canon_sha256":"6093ef0f110a6799d5a08e696e570b4c06752f81850cdbade9ff48ab17c17605"},"schema_version":"1.0"},"canonical_sha256":"9681458a488b0bf50e4af9f99ddf74af870bdc9cd1851da7cf31a2e83609effd","source":{"kind":"arxiv","id":"1203.2725","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2725","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2725v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2725","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"S2AULCSIRMF7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S2AULCSIRMF7KDSK","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S2AULCSI","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:S2AULCSIRMF7KDSK7H4Z3X3UV6","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-13T07:34:27Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"31516045e1af77feff355c96d6be150eeb792d7652824abd37ef490fb27ab96d","abstract_canon_sha256":"6093ef0f110a6799d5a08e696e570b4c06752f81850cdbade9ff48ab17c17605"},"schema_version":"1.0"},"canonical_sha256":"9681458a488b0bf50e4af9f99ddf74af870bdc9cd1851da7cf31a2e83609effd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:14.784903Z","signature_b64":"lOujxPWhJAB9nrrn8TrzrVV0FPFo3/d3aLt2zchFzSsQnuZyS7TxUxqW58kbZ5GULEhzFHHCGo0YHzvpreBaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9681458a488b0bf50e4af9f99ddf74af870bdc9cd1851da7cf31a2e83609effd","last_reissued_at":"2026-05-18T04:00:14.784050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:14.784050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2725","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-05-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kawW6nabpAS1vJKAUngyVhgfhQDlyT7P5NB7XHjptoReD9EnkkJYIGikUlzc9Al/7MFCKqu70FWhzJeclK0VDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:45:58.969946Z"},"content_sha256":"1c0be0e2fcbfe061eff6e3e977c66f7aa4105f2c5515678163fc569834d4c2c7","schema_version":"1.0","event_id":"sha256:1c0be0e2fcbfe061eff6e3e977c66f7aa4105f2c5515678163fc569834d4c2c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:S2AULCSIRMF7KDSK7H4Z3X3UV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.NI","authors_text":"Frans Schalekamp, Henry Lin","submitted_at":"2012-03-13T07:34:27Z","abstract_excerpt":"We show NP-hardness of the minimum latency scheduling (MLS) problem under the physical model of wireless networking. In this model a transmission is received successfully if the Signal to Interference-plus-Noise Ratio (SINR), is above a given threshold. In the minimum latency scheduling problem, the goal is to assign a time slot and power level to each transmission, so that all the messages are received successfully, and the number of distinct times slots is minimized.\n  Despite its seeming simplicity and several previous hardness results for various settings of the minimum latency scheduling "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2725","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":""},"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-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mv8XLr2rgCtwE+WSIrM9bNq5IiGibnjO1CzuoVSeKpaaGyJVm0ECO4MciXB/znKtKC5jvuIJCt9ShCQcwG2bDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:45:58.970547Z"},"content_sha256":"0decc354aefecf85ba9f6a0ec547ae12ea274ab51c09815c28d8a603080b994f","schema_version":"1.0","event_id":"sha256:0decc354aefecf85ba9f6a0ec547ae12ea274ab51c09815c28d8a603080b994f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2AULCSIRMF7KDSK7H4Z3X3UV6/bundle.json","state_url":"https://pith.science/pith/S2AULCSIRMF7KDSK7H4Z3X3UV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2AULCSIRMF7KDSK7H4Z3X3UV6/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-06-01T10:45:58Z","links":{"resolver":"https://pith.science/pith/S2AULCSIRMF7KDSK7H4Z3X3UV6","bundle":"https://pith.science/pith/S2AULCSIRMF7KDSK7H4Z3X3UV6/bundle.json","state":"https://pith.science/pith/S2AULCSIRMF7KDSK7H4Z3X3UV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2AULCSIRMF7KDSK7H4Z3X3UV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:S2AULCSIRMF7KDSK7H4Z3X3UV6","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":"6093ef0f110a6799d5a08e696e570b4c06752f81850cdbade9ff48ab17c17605","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-13T07:34:27Z","title_canon_sha256":"31516045e1af77feff355c96d6be150eeb792d7652824abd37ef490fb27ab96d"},"schema_version":"1.0","source":{"id":"1203.2725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2725","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2725v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2725","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"S2AULCSIRMF7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S2AULCSIRMF7KDSK","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S2AULCSI","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:0decc354aefecf85ba9f6a0ec547ae12ea274ab51c09815c28d8a603080b994f","target":"graph","created_at":"2026-05-18T04:00:14Z","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":"We show NP-hardness of the minimum latency scheduling (MLS) problem under the physical model of wireless networking. In this model a transmission is received successfully if the Signal to Interference-plus-Noise Ratio (SINR), is above a given threshold. In the minimum latency scheduling problem, the goal is to assign a time slot and power level to each transmission, so that all the messages are received successfully, and the number of distinct times slots is minimized.\n  Despite its seeming simplicity and several previous hardness results for various settings of the minimum latency scheduling ","authors_text":"Frans Schalekamp, Henry Lin","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-13T07:34:27Z","title":"On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2725","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:1c0be0e2fcbfe061eff6e3e977c66f7aa4105f2c5515678163fc569834d4c2c7","target":"record","created_at":"2026-05-18T04:00:14Z","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":"6093ef0f110a6799d5a08e696e570b4c06752f81850cdbade9ff48ab17c17605","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-13T07:34:27Z","title_canon_sha256":"31516045e1af77feff355c96d6be150eeb792d7652824abd37ef490fb27ab96d"},"schema_version":"1.0","source":{"id":"1203.2725","kind":"arxiv","version":1}},"canonical_sha256":"9681458a488b0bf50e4af9f99ddf74af870bdc9cd1851da7cf31a2e83609effd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9681458a488b0bf50e4af9f99ddf74af870bdc9cd1851da7cf31a2e83609effd","first_computed_at":"2026-05-18T04:00:14.784050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:14.784050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lOujxPWhJAB9nrrn8TrzrVV0FPFo3/d3aLt2zchFzSsQnuZyS7TxUxqW58kbZ5GULEhzFHHCGo0YHzvpreBaCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:14.784903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c0be0e2fcbfe061eff6e3e977c66f7aa4105f2c5515678163fc569834d4c2c7","sha256:0decc354aefecf85ba9f6a0ec547ae12ea274ab51c09815c28d8a603080b994f"],"state_sha256":"27142e37d45785044b51df05055915177b76544467633e719eef0bcd7d140468"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VbSPeAaPoZodCoC7DgRjjn0BUQM9NRcIDf35ZT1KfIlpUz6YOI4pM7duUJ6tuGAhDdcSiLHsU6QSrb/TNphnCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:45:58.973348Z","bundle_sha256":"c679bf660bbdd3d979100289bfcae876f39f7a200047216775da0a063e7bc993"}}