{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S6YDBYMUEWM6HGXOQTGVARSBTS","short_pith_number":"pith:S6YDBYMU","schema_version":"1.0","canonical_sha256":"97b030e1942599e39aee84cd5046419c867bc62046a10b75e981da58c69f49b1","source":{"kind":"arxiv","id":"1810.05333","version":3},"attestation_state":"computed","paper":{"title":"On the Properties of Gromov Matrices and their Applications in Network Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Feng Ji, Wee Peng Tay, Wenchang Tang","submitted_at":"2018-10-12T03:06:22Z","abstract_excerpt":"The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a heuristic procedure for general graphs by (usually randomly) choosing a spanning tree in the graph to apply the approach developed for trees. However, there are an intractable number of spanning trees in a dense graph. In this paper, we represent a weighted tree with a matrix, which we call a Gromov matrix. We propose a method that constructs a family of Gromov matr"},"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":"1810.05333","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-12T03:06:22Z","cross_cats_sorted":[],"title_canon_sha256":"90df34e5b45ed366dff070cbd93dce468b7355c513baa07f64037d68fb484b0a","abstract_canon_sha256":"9457f63e773b2d34b136a65e664c6ac494af37290cac64ddbf72ba85e1f6469b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:36.139435Z","signature_b64":"+RxSSKYUreuBd7XNiID646NALVEJSGDW5rDkXA3JI+NTOQXg1DmsYQfWfRSbbpJHapC5r8kKSUnhRXbL21rSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97b030e1942599e39aee84cd5046419c867bc62046a10b75e981da58c69f49b1","last_reissued_at":"2026-05-17T23:45:36.138756Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:36.138756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Properties of Gromov Matrices and their Applications in Network Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Feng Ji, Wee Peng Tay, Wenchang Tang","submitted_at":"2018-10-12T03:06:22Z","abstract_excerpt":"The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a heuristic procedure for general graphs by (usually randomly) choosing a spanning tree in the graph to apply the approach developed for trees. However, there are an intractable number of spanning trees in a dense graph. In this paper, we represent a weighted tree with a matrix, which we call a Gromov matrix. We propose a method that constructs a family of Gromov matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05333","kind":"arxiv","version":3},"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":"1810.05333","created_at":"2026-05-17T23:45:36.138860+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05333v3","created_at":"2026-05-17T23:45:36.138860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05333","created_at":"2026-05-17T23:45:36.138860+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6YDBYMUEWM6","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6YDBYMUEWM6HGXO","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6YDBYMU","created_at":"2026-05-18T12:32:50.500415+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/S6YDBYMUEWM6HGXOQTGVARSBTS","json":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS.json","graph_json":"https://pith.science/api/pith-number/S6YDBYMUEWM6HGXOQTGVARSBTS/graph.json","events_json":"https://pith.science/api/pith-number/S6YDBYMUEWM6HGXOQTGVARSBTS/events.json","paper":"https://pith.science/paper/S6YDBYMU"},"agent_actions":{"view_html":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS","download_json":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS.json","view_paper":"https://pith.science/paper/S6YDBYMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05333&json=true","fetch_graph":"https://pith.science/api/pith-number/S6YDBYMUEWM6HGXOQTGVARSBTS/graph.json","fetch_events":"https://pith.science/api/pith-number/S6YDBYMUEWM6HGXOQTGVARSBTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS/action/storage_attestation","attest_author":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS/action/author_attestation","sign_citation":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS/action/citation_signature","submit_replication":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS/action/replication_record"}},"created_at":"2026-05-17T23:45:36.138860+00:00","updated_at":"2026-05-17T23:45:36.138860+00:00"}