{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2G2RE2Z6X5CADL374S6JM76AYD","short_pith_number":"pith:2G2RE2Z6","schema_version":"1.0","canonical_sha256":"d1b5126b3ebf4401af7fe4bc967fc0c0ef72486bb8954c164495ff747c4ad0b9","source":{"kind":"arxiv","id":"1212.2310","version":2},"attestation_state":"computed","paper":{"title":"Active Learning of Multiple Source Multiple Destination Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Animashree Anandkumar, Athina Markopoulou, Maciej Kurant, Michael Rabbat, Pegah Sattari","submitted_at":"2012-12-11T06:36:49Z","abstract_excerpt":"We consider the problem of inferring the topology of a network with $M$ sources and $N$ receivers (hereafter referred to as an $M$-by-$N$ network), by sending probes between the sources and receivers. Prior work has shown that this problem can be decomposed into two parts: first, infer smaller subnetwork components (i.e., $1$-by-$N$'s or $2$-by-$2$'s) and then merge these components to identify the $M$-by-$N$ topology. In this paper, we focus on the second part, which had previously received less attention in the literature. In particular, we assume that a $1$-by-$N$ topology is given and that"},"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":"1212.2310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-12-11T06:36:49Z","cross_cats_sorted":[],"title_canon_sha256":"3969aeb67649a44a74619a1d1e2484c0252697fd69d3b652b2b9ac2318e1d780","abstract_canon_sha256":"2096a416919c26cf5eb33031eb2d8ba2acdb9b9cd3a261afbaada90d3886a4c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:05.327299Z","signature_b64":"LQ5JP58Y9rgwgoRngb6I3zFGvVA26KGFG08nL+trcbVu86zR/cyP2WGpgwv6Od8M3Ed7AmBf935RSXNK5p0EBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1b5126b3ebf4401af7fe4bc967fc0c0ef72486bb8954c164495ff747c4ad0b9","last_reissued_at":"2026-05-18T02:56:05.326895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:05.326895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active Learning of Multiple Source Multiple Destination Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Animashree Anandkumar, Athina Markopoulou, Maciej Kurant, Michael Rabbat, Pegah Sattari","submitted_at":"2012-12-11T06:36:49Z","abstract_excerpt":"We consider the problem of inferring the topology of a network with $M$ sources and $N$ receivers (hereafter referred to as an $M$-by-$N$ network), by sending probes between the sources and receivers. Prior work has shown that this problem can be decomposed into two parts: first, infer smaller subnetwork components (i.e., $1$-by-$N$'s or $2$-by-$2$'s) and then merge these components to identify the $M$-by-$N$ topology. In this paper, we focus on the second part, which had previously received less attention in the literature. In particular, we assume that a $1$-by-$N$ topology is given and that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2310","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.2310","created_at":"2026-05-18T02:56:05.326952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2310v2","created_at":"2026-05-18T02:56:05.326952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2310","created_at":"2026-05-18T02:56:05.326952+00:00"},{"alias_kind":"pith_short_12","alias_value":"2G2RE2Z6X5CA","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2G2RE2Z6X5CADL37","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2G2RE2Z6","created_at":"2026-05-18T12:26:50.516681+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/2G2RE2Z6X5CADL374S6JM76AYD","json":"https://pith.science/pith/2G2RE2Z6X5CADL374S6JM76AYD.json","graph_json":"https://pith.science/api/pith-number/2G2RE2Z6X5CADL374S6JM76AYD/graph.json","events_json":"https://pith.science/api/pith-number/2G2RE2Z6X5CADL374S6JM76AYD/events.json","paper":"https://pith.science/paper/2G2RE2Z6"},"agent_actions":{"view_html":"https://pith.science/pith/2G2RE2Z6X5CADL374S6JM76AYD","download_json":"https://pith.science/pith/2G2RE2Z6X5CADL374S6JM76AYD.json","view_paper":"https://pith.science/paper/2G2RE2Z6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2310&json=true","fetch_graph":"https://pith.science/api/pith-number/2G2RE2Z6X5CADL374S6JM76AYD/graph.json","fetch_events":"https://pith.science/api/pith-number/2G2RE2Z6X5CADL374S6JM76AYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2G2RE2Z6X5CADL374S6JM76AYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2G2RE2Z6X5CADL374S6JM76AYD/action/storage_attestation","attest_author":"https://pith.science/pith/2G2RE2Z6X5CADL374S6JM76AYD/action/author_attestation","sign_citation":"https://pith.science/pith/2G2RE2Z6X5CADL374S6JM76AYD/action/citation_signature","submit_replication":"https://pith.science/pith/2G2RE2Z6X5CADL374S6JM76AYD/action/replication_record"}},"created_at":"2026-05-18T02:56:05.326952+00:00","updated_at":"2026-05-18T02:56:05.326952+00:00"}