{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XWRQT4MBGHLWQIBCCDVZ7APIWE","short_pith_number":"pith:XWRQT4MB","schema_version":"1.0","canonical_sha256":"bda309f18131d768202210eb9f81e8b12307b1c5e01853bfcab0078c1960d78d","source":{"kind":"arxiv","id":"1501.04692","version":1},"attestation_state":"computed","paper":{"title":"Reflective Network Tomography Based on Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Fumie Ono, Kenichi Takizawa, Kensuke Nakanishi, Ryu Miura, Shinsuke Hara, Takahiro Matsuda","submitted_at":"2015-01-20T01:32:52Z","abstract_excerpt":"Network tomography means to estimate internal link states from end-to-end path measurements. In conventional network tomography, to make packets transmissively penetrate a network, a cooperation between transmitter and receiver nodes is required, which are located at different places in the network. In this paper, we propose a reflective network tomography, which can totally avoid such a cooperation, since a single transceiver node transmits packets and receives them after traversing back from the network. Furthermore, we are interested in identification of a limited number of bottleneck links"},"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":"1501.04692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-20T01:32:52Z","cross_cats_sorted":[],"title_canon_sha256":"cdd2fbcfdf617340f6ea4865f7c6c6ba897da80d11388169e07a21bfa81080b0","abstract_canon_sha256":"5f0da338c538b05fd0f454ff0b9e0ed94abc5afcaaf639e0644938113e9ed4c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:03.076890Z","signature_b64":"FNKF6TeFavzU9ca8+SY4fUjzYqGweP8G59jXPj5ss+WccsmEVl6DmYBDCnqqQnl4VG+3w8Wqh4jB3JGthDQiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bda309f18131d768202210eb9f81e8b12307b1c5e01853bfcab0078c1960d78d","last_reissued_at":"2026-05-18T02:29:03.076265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:03.076265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reflective Network Tomography Based on Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Fumie Ono, Kenichi Takizawa, Kensuke Nakanishi, Ryu Miura, Shinsuke Hara, Takahiro Matsuda","submitted_at":"2015-01-20T01:32:52Z","abstract_excerpt":"Network tomography means to estimate internal link states from end-to-end path measurements. In conventional network tomography, to make packets transmissively penetrate a network, a cooperation between transmitter and receiver nodes is required, which are located at different places in the network. In this paper, we propose a reflective network tomography, which can totally avoid such a cooperation, since a single transceiver node transmits packets and receives them after traversing back from the network. Furthermore, we are interested in identification of a limited number of bottleneck links"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04692","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":"1501.04692","created_at":"2026-05-18T02:29:03.076370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04692v1","created_at":"2026-05-18T02:29:03.076370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04692","created_at":"2026-05-18T02:29:03.076370+00:00"},{"alias_kind":"pith_short_12","alias_value":"XWRQT4MBGHLW","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XWRQT4MBGHLWQIBC","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XWRQT4MB","created_at":"2026-05-18T12:29:50.041715+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/XWRQT4MBGHLWQIBCCDVZ7APIWE","json":"https://pith.science/pith/XWRQT4MBGHLWQIBCCDVZ7APIWE.json","graph_json":"https://pith.science/api/pith-number/XWRQT4MBGHLWQIBCCDVZ7APIWE/graph.json","events_json":"https://pith.science/api/pith-number/XWRQT4MBGHLWQIBCCDVZ7APIWE/events.json","paper":"https://pith.science/paper/XWRQT4MB"},"agent_actions":{"view_html":"https://pith.science/pith/XWRQT4MBGHLWQIBCCDVZ7APIWE","download_json":"https://pith.science/pith/XWRQT4MBGHLWQIBCCDVZ7APIWE.json","view_paper":"https://pith.science/paper/XWRQT4MB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04692&json=true","fetch_graph":"https://pith.science/api/pith-number/XWRQT4MBGHLWQIBCCDVZ7APIWE/graph.json","fetch_events":"https://pith.science/api/pith-number/XWRQT4MBGHLWQIBCCDVZ7APIWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XWRQT4MBGHLWQIBCCDVZ7APIWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XWRQT4MBGHLWQIBCCDVZ7APIWE/action/storage_attestation","attest_author":"https://pith.science/pith/XWRQT4MBGHLWQIBCCDVZ7APIWE/action/author_attestation","sign_citation":"https://pith.science/pith/XWRQT4MBGHLWQIBCCDVZ7APIWE/action/citation_signature","submit_replication":"https://pith.science/pith/XWRQT4MBGHLWQIBCCDVZ7APIWE/action/replication_record"}},"created_at":"2026-05-18T02:29:03.076370+00:00","updated_at":"2026-05-18T02:29:03.076370+00:00"}