{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LD52LSBFAKLPTND3GJAQ2J22NB","short_pith_number":"pith:LD52LSBF","schema_version":"1.0","canonical_sha256":"58fba5c8250296f9b47b32410d275a6849e611e187aac4fa20374b169c9c5c52","source":{"kind":"arxiv","id":"1806.04742","version":1},"attestation_state":"computed","paper":{"title":"Minimum Shared-Power Edge Cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Anna Lubiw, Debajyoti Mondal, Kshitij Jain, Sergio Cabello","submitted_at":"2018-06-12T20:03:05Z","abstract_excerpt":"We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the goal is to find an s-t cut by assigning \"powers\" at the vertices and removing an edge if the sum of the powers at its endpoints is at least its weight. The objective is to minimize the sum of the assigned powers.\n  MSPEC is a graph generalization of a barrier coverage problem in a wireless sensor network: given a set of unit disks with centers in a rectangle, what is the minimum total amount by which we must shrink t"},"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":"1806.04742","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T20:03:05Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4a1d8ad3429f18aff0ce1d86978e511b8bb3c1787eac4eaedba7dabbb8e4fb97","abstract_canon_sha256":"f5d137c5e5f35861325de9ed7591fb630b8128073cdbedaab981be934efce0cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:20.993993Z","signature_b64":"vn4SDvDllIL4tKqlARzO2YQbOJyAfkwqnCTJN7hTuIWj5Y3YVvLWE8L29srog7b7KzHDT0TwCIKQg6vmqCUQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58fba5c8250296f9b47b32410d275a6849e611e187aac4fa20374b169c9c5c52","last_reissued_at":"2026-05-18T00:13:20.993527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:20.993527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Shared-Power Edge Cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Anna Lubiw, Debajyoti Mondal, Kshitij Jain, Sergio Cabello","submitted_at":"2018-06-12T20:03:05Z","abstract_excerpt":"We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the goal is to find an s-t cut by assigning \"powers\" at the vertices and removing an edge if the sum of the powers at its endpoints is at least its weight. The objective is to minimize the sum of the assigned powers.\n  MSPEC is a graph generalization of a barrier coverage problem in a wireless sensor network: given a set of unit disks with centers in a rectangle, what is the minimum total amount by which we must shrink t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04742","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.04742","created_at":"2026-05-18T00:13:20.993585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04742v1","created_at":"2026-05-18T00:13:20.993585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04742","created_at":"2026-05-18T00:13:20.993585+00:00"},{"alias_kind":"pith_short_12","alias_value":"LD52LSBFAKLP","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LD52LSBFAKLPTND3","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LD52LSBF","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LD52LSBFAKLPTND3GJAQ2J22NB","json":"https://pith.science/pith/LD52LSBFAKLPTND3GJAQ2J22NB.json","graph_json":"https://pith.science/api/pith-number/LD52LSBFAKLPTND3GJAQ2J22NB/graph.json","events_json":"https://pith.science/api/pith-number/LD52LSBFAKLPTND3GJAQ2J22NB/events.json","paper":"https://pith.science/paper/LD52LSBF"},"agent_actions":{"view_html":"https://pith.science/pith/LD52LSBFAKLPTND3GJAQ2J22NB","download_json":"https://pith.science/pith/LD52LSBFAKLPTND3GJAQ2J22NB.json","view_paper":"https://pith.science/paper/LD52LSBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04742&json=true","fetch_graph":"https://pith.science/api/pith-number/LD52LSBFAKLPTND3GJAQ2J22NB/graph.json","fetch_events":"https://pith.science/api/pith-number/LD52LSBFAKLPTND3GJAQ2J22NB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LD52LSBFAKLPTND3GJAQ2J22NB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LD52LSBFAKLPTND3GJAQ2J22NB/action/storage_attestation","attest_author":"https://pith.science/pith/LD52LSBFAKLPTND3GJAQ2J22NB/action/author_attestation","sign_citation":"https://pith.science/pith/LD52LSBFAKLPTND3GJAQ2J22NB/action/citation_signature","submit_replication":"https://pith.science/pith/LD52LSBFAKLPTND3GJAQ2J22NB/action/replication_record"}},"created_at":"2026-05-18T00:13:20.993585+00:00","updated_at":"2026-05-18T00:13:20.993585+00:00"}