{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F5UMRACA6N65JAI4YEWL5AX2P4","short_pith_number":"pith:F5UMRACA","schema_version":"1.0","canonical_sha256":"2f68c88040f37dd4811cc12cbe82fa7f3cb50caf1492ca9620f41e114447f67a","source":{"kind":"arxiv","id":"1510.01866","version":1},"attestation_state":"computed","paper":{"title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Christine Markarian, Faisal N. Abu-Khzam, Friedhelm Meyer auf der Heide, Michael Schubert","submitted_at":"2015-10-07T09:12:10Z","abstract_excerpt":"We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and are modeled using the well-established disk graphs. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in "},"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":"1510.01866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-10-07T09:12:10Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7dff4eb2149197c77bc6143652302d6aa41df607a79d88774378a7f90f1b7ea4","abstract_canon_sha256":"65d7494c1ceef0c687eb203842bcf870c87da1fb567c7acfcdf63c44b0bbf6a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:50.166380Z","signature_b64":"vb+YxP8aY5tmD51Rdi1zTv2QqIdzXf03i+igfFpVm7bX1IGJW1bvcmag7xLXVnoj93/9m4UnrnOYfzW4Gy2kBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f68c88040f37dd4811cc12cbe82fa7f3cb50caf1492ca9620f41e114447f67a","last_reissued_at":"2026-05-18T01:30:50.165782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:50.165782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Christine Markarian, Faisal N. Abu-Khzam, Friedhelm Meyer auf der Heide, Michael Schubert","submitted_at":"2015-10-07T09:12:10Z","abstract_excerpt":"We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and are modeled using the well-established disk graphs. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01866","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":"1510.01866","created_at":"2026-05-18T01:30:50.165866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01866v1","created_at":"2026-05-18T01:30:50.165866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01866","created_at":"2026-05-18T01:30:50.165866+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5UMRACA6N65","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5UMRACA6N65JAI4","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5UMRACA","created_at":"2026-05-18T12:29:19.899920+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/F5UMRACA6N65JAI4YEWL5AX2P4","json":"https://pith.science/pith/F5UMRACA6N65JAI4YEWL5AX2P4.json","graph_json":"https://pith.science/api/pith-number/F5UMRACA6N65JAI4YEWL5AX2P4/graph.json","events_json":"https://pith.science/api/pith-number/F5UMRACA6N65JAI4YEWL5AX2P4/events.json","paper":"https://pith.science/paper/F5UMRACA"},"agent_actions":{"view_html":"https://pith.science/pith/F5UMRACA6N65JAI4YEWL5AX2P4","download_json":"https://pith.science/pith/F5UMRACA6N65JAI4YEWL5AX2P4.json","view_paper":"https://pith.science/paper/F5UMRACA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01866&json=true","fetch_graph":"https://pith.science/api/pith-number/F5UMRACA6N65JAI4YEWL5AX2P4/graph.json","fetch_events":"https://pith.science/api/pith-number/F5UMRACA6N65JAI4YEWL5AX2P4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5UMRACA6N65JAI4YEWL5AX2P4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5UMRACA6N65JAI4YEWL5AX2P4/action/storage_attestation","attest_author":"https://pith.science/pith/F5UMRACA6N65JAI4YEWL5AX2P4/action/author_attestation","sign_citation":"https://pith.science/pith/F5UMRACA6N65JAI4YEWL5AX2P4/action/citation_signature","submit_replication":"https://pith.science/pith/F5UMRACA6N65JAI4YEWL5AX2P4/action/replication_record"}},"created_at":"2026-05-18T01:30:50.165866+00:00","updated_at":"2026-05-18T01:30:50.165866+00:00"}