{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S6YDBYMUEWM6HGXOQTGVARSBTS","short_pith_number":"pith:S6YDBYMU","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"},"canonical_sha256":"97b030e1942599e39aee84cd5046419c867bc62046a10b75e981da58c69f49b1","source":{"kind":"arxiv","id":"1810.05333","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05333","created_at":"2026-05-17T23:45:36Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05333v3","created_at":"2026-05-17T23:45:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05333","created_at":"2026-05-17T23:45:36Z"},{"alias_kind":"pith_short_12","alias_value":"S6YDBYMUEWM6","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S6YDBYMUEWM6HGXO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S6YDBYMU","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S6YDBYMUEWM6HGXOQTGVARSBTS","target":"record","payload":{"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"},"canonical_sha256":"97b030e1942599e39aee84cd5046419c867bc62046a10b75e981da58c69f49b1","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"},"source_kind":"arxiv","source_id":"1810.05333","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NMbplwtwclcXvgQfnP6ka5/6MFnBGhdPSl+2cyDXwVgZlAnHiLIpfgQEhjgRQupSnwbMd2BIPenhFcwgGezFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:35:00.880644Z"},"content_sha256":"83ba82e5bae501449282cbf6968bc2dcd2d70dde9399fd732327e4467876ada7","schema_version":"1.0","event_id":"sha256:83ba82e5bae501449282cbf6968bc2dcd2d70dde9399fd732327e4467876ada7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S6YDBYMUEWM6HGXOQTGVARSBTS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdlc64V4UlKl3d37yfo5e9JNS6CSKBcBIHFnKizMuMaAajRdNfcqTFQQ+PbTlQ/qc3sA6zg1JEK3K1YnX/FVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:35:00.881112Z"},"content_sha256":"f4dc742f41553d1f913e05ca7ac2b10edf0685c7de55f8cb9dc7b3d9cdcf86ad","schema_version":"1.0","event_id":"sha256:f4dc742f41553d1f913e05ca7ac2b10edf0685c7de55f8cb9dc7b3d9cdcf86ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS/bundle.json","state_url":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6YDBYMUEWM6HGXOQTGVARSBTS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T12:35:00Z","links":{"resolver":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS","bundle":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS/bundle.json","state":"https://pith.science/pith/S6YDBYMUEWM6HGXOQTGVARSBTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6YDBYMUEWM6HGXOQTGVARSBTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S6YDBYMUEWM6HGXOQTGVARSBTS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9457f63e773b2d34b136a65e664c6ac494af37290cac64ddbf72ba85e1f6469b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-12T03:06:22Z","title_canon_sha256":"90df34e5b45ed366dff070cbd93dce468b7355c513baa07f64037d68fb484b0a"},"schema_version":"1.0","source":{"id":"1810.05333","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05333","created_at":"2026-05-17T23:45:36Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05333v3","created_at":"2026-05-17T23:45:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05333","created_at":"2026-05-17T23:45:36Z"},{"alias_kind":"pith_short_12","alias_value":"S6YDBYMUEWM6","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S6YDBYMUEWM6HGXO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S6YDBYMU","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:f4dc742f41553d1f913e05ca7ac2b10edf0685c7de55f8cb9dc7b3d9cdcf86ad","target":"graph","created_at":"2026-05-17T23:45:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Feng Ji, Wee Peng Tay, Wenchang Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-12T03:06:22Z","title":"On the Properties of Gromov Matrices and their Applications in Network Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05333","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:83ba82e5bae501449282cbf6968bc2dcd2d70dde9399fd732327e4467876ada7","target":"record","created_at":"2026-05-17T23:45:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9457f63e773b2d34b136a65e664c6ac494af37290cac64ddbf72ba85e1f6469b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-12T03:06:22Z","title_canon_sha256":"90df34e5b45ed366dff070cbd93dce468b7355c513baa07f64037d68fb484b0a"},"schema_version":"1.0","source":{"id":"1810.05333","kind":"arxiv","version":3}},"canonical_sha256":"97b030e1942599e39aee84cd5046419c867bc62046a10b75e981da58c69f49b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97b030e1942599e39aee84cd5046419c867bc62046a10b75e981da58c69f49b1","first_computed_at":"2026-05-17T23:45:36.138756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:36.138756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+RxSSKYUreuBd7XNiID646NALVEJSGDW5rDkXA3JI+NTOQXg1DmsYQfWfRSbbpJHapC5r8kKSUnhRXbL21rSBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:36.139435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05333","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83ba82e5bae501449282cbf6968bc2dcd2d70dde9399fd732327e4467876ada7","sha256:f4dc742f41553d1f913e05ca7ac2b10edf0685c7de55f8cb9dc7b3d9cdcf86ad"],"state_sha256":"daa53068cf8ba6bccacfb014dd82a6221331887c0cce873acb5885792c544fbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EvBi0jckSPmY0KxwlVfLWIsMl2MqUi5wJ3jyE9mboTlbX6AFhIi06c7RXVfdLsTibx0LbDYX34KFosDvAmJLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:35:00.883924Z","bundle_sha256":"8901d0c90c22857ee18489fa4874e1715e9e54cfd2f292c900d652a091533ce8"}}