{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JUEVNF2Z3GUCZLG64KV6WVUVFM","short_pith_number":"pith:JUEVNF2Z","canonical_record":{"source":{"id":"1601.02697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-12T00:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"57f2d3cae5d1aa297486869ada4a6519ce906948bb30895fff7c7214ede383b0","abstract_canon_sha256":"2eced3f25f0cf898d2b23fda6ebb2b6223f91dc2a8c2af44795a1a3dd8ffd0e8"},"schema_version":"1.0"},"canonical_sha256":"4d09569759d9a82cacdee2abeb56952b08d57f410ab969971da81b87df4692b4","source":{"kind":"arxiv","id":"1601.02697","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02697","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02697v1","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02697","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"pith_short_12","alias_value":"JUEVNF2Z3GUC","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JUEVNF2Z3GUCZLG6","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JUEVNF2Z","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JUEVNF2Z3GUCZLG64KV6WVUVFM","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-12T00:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"57f2d3cae5d1aa297486869ada4a6519ce906948bb30895fff7c7214ede383b0","abstract_canon_sha256":"2eced3f25f0cf898d2b23fda6ebb2b6223f91dc2a8c2af44795a1a3dd8ffd0e8"},"schema_version":"1.0"},"canonical_sha256":"4d09569759d9a82cacdee2abeb56952b08d57f410ab969971da81b87df4692b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:01.684540Z","signature_b64":"pwaC674m+Rp99j9k0fUOqEccWDtygz0Cuml7uUOomhOw1G4imzEXFspPvXHNhKMXFpwRQNvVlZMrgsIe58LBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d09569759d9a82cacdee2abeb56952b08d57f410ab969971da81b87df4692b4","last_reissued_at":"2026-05-18T01:23:01.683764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:01.683764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02697","source_version":1,"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-18T01:23:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X+G5YXTDCcRNX5h2MnW63hfnQ7GkEKGjYM/w2kExIJGuxnqey/vR5mPWfAQIzYRzAuFCJRflOrsdSYNHEih6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T05:57:48.739056Z"},"content_sha256":"50f1db5cb4ea0d70bb81b1026a77b969c04e424ea4c59369c7631b045180beb9","schema_version":"1.0","event_id":"sha256:50f1db5cb4ea0d70bb81b1026a77b969c04e424ea4c59369c7631b045180beb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JUEVNF2Z3GUCZLG64KV6WVUVFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Average Delay of Routing Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Saber Mirzaei","submitted_at":"2016-01-12T00:05:24Z","abstract_excerpt":"The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T. In the case where the vertices of G are mapped into the leaves of the host tree T the underlying tree is called a routing tree and if the internal vertices of T are forced to have degree 3, the host tree is known as layout tree. Different optimization problems have been studied in the class of communication tree problems such as well-known minimum edge dilation and minimum edge congestio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02697","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"},"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-18T01:23:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0MuQgccGM00emL0PZzo2yYHj5VsK1cqqFpI3rk3QbrZ6c6ZKe0HtcsB5A11KKuX+aD+SA6T4dXg1Z18Q8uk6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T05:57:48.739430Z"},"content_sha256":"856cf482847d4593ca6b26b68b9a2356a8eb836b3b3c5d499ec76d2dc742d357","schema_version":"1.0","event_id":"sha256:856cf482847d4593ca6b26b68b9a2356a8eb836b3b3c5d499ec76d2dc742d357"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUEVNF2Z3GUCZLG64KV6WVUVFM/bundle.json","state_url":"https://pith.science/pith/JUEVNF2Z3GUCZLG64KV6WVUVFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUEVNF2Z3GUCZLG64KV6WVUVFM/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-07-04T05:57:48Z","links":{"resolver":"https://pith.science/pith/JUEVNF2Z3GUCZLG64KV6WVUVFM","bundle":"https://pith.science/pith/JUEVNF2Z3GUCZLG64KV6WVUVFM/bundle.json","state":"https://pith.science/pith/JUEVNF2Z3GUCZLG64KV6WVUVFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUEVNF2Z3GUCZLG64KV6WVUVFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JUEVNF2Z3GUCZLG64KV6WVUVFM","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":"2eced3f25f0cf898d2b23fda6ebb2b6223f91dc2a8c2af44795a1a3dd8ffd0e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-12T00:05:24Z","title_canon_sha256":"57f2d3cae5d1aa297486869ada4a6519ce906948bb30895fff7c7214ede383b0"},"schema_version":"1.0","source":{"id":"1601.02697","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02697","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02697v1","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02697","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"pith_short_12","alias_value":"JUEVNF2Z3GUC","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JUEVNF2Z3GUCZLG6","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JUEVNF2Z","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:856cf482847d4593ca6b26b68b9a2356a8eb836b3b3c5d499ec76d2dc742d357","target":"graph","created_at":"2026-05-18T01:23:01Z","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 general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T. In the case where the vertices of G are mapped into the leaves of the host tree T the underlying tree is called a routing tree and if the internal vertices of T are forced to have degree 3, the host tree is known as layout tree. Different optimization problems have been studied in the class of communication tree problems such as well-known minimum edge dilation and minimum edge congestio","authors_text":"Saber Mirzaei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-12T00:05:24Z","title":"Minimum Average Delay of Routing Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02697","kind":"arxiv","version":1},"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:50f1db5cb4ea0d70bb81b1026a77b969c04e424ea4c59369c7631b045180beb9","target":"record","created_at":"2026-05-18T01:23:01Z","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":"2eced3f25f0cf898d2b23fda6ebb2b6223f91dc2a8c2af44795a1a3dd8ffd0e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-12T00:05:24Z","title_canon_sha256":"57f2d3cae5d1aa297486869ada4a6519ce906948bb30895fff7c7214ede383b0"},"schema_version":"1.0","source":{"id":"1601.02697","kind":"arxiv","version":1}},"canonical_sha256":"4d09569759d9a82cacdee2abeb56952b08d57f410ab969971da81b87df4692b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d09569759d9a82cacdee2abeb56952b08d57f410ab969971da81b87df4692b4","first_computed_at":"2026-05-18T01:23:01.683764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:01.683764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pwaC674m+Rp99j9k0fUOqEccWDtygz0Cuml7uUOomhOw1G4imzEXFspPvXHNhKMXFpwRQNvVlZMrgsIe58LBAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:01.684540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02697","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50f1db5cb4ea0d70bb81b1026a77b969c04e424ea4c59369c7631b045180beb9","sha256:856cf482847d4593ca6b26b68b9a2356a8eb836b3b3c5d499ec76d2dc742d357"],"state_sha256":"cc2db9d250a80064da196a118ef0c8aa0314b7d0a268e727a645c234ff98a8df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Khqbq0CCWwnLZ33w4V+T1QL+2yTUrwfow6uS9KborLktFnSBA/ArOefaodjty/egG0OmOegPWmH2sjGCstVvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T05:57:48.741632Z","bundle_sha256":"a326a519257147fc616d397049d867a6d6212f3f89fbe0d50e181bfc7c8fbbca"}}