{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZIZQP2ZXUCJY6MOR77ZWT6FE3K","short_pith_number":"pith:ZIZQP2ZX","canonical_record":{"source":{"id":"1610.01475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-05T15:13:58Z","cross_cats_sorted":[],"title_canon_sha256":"eab1febed73023c5a8c08f9502ed77ae0031aaeaf1aece86c0d54ffd32368bd6","abstract_canon_sha256":"243f2fac28b0ebfa3453d65309e8fd075fc3c87695b66eee93c6a749e11bdb4b"},"schema_version":"1.0"},"canonical_sha256":"ca3307eb37a0938f31d1fff369f8a4da9fec6c2d8467456b8781aba74ecc37f8","source":{"kind":"arxiv","id":"1610.01475","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01475","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01475v2","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01475","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZIZQP2ZXUCJY","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZIZQP2ZXUCJY6MOR","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZIZQP2ZX","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZIZQP2ZXUCJY6MOR77ZWT6FE3K","target":"record","payload":{"canonical_record":{"source":{"id":"1610.01475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-05T15:13:58Z","cross_cats_sorted":[],"title_canon_sha256":"eab1febed73023c5a8c08f9502ed77ae0031aaeaf1aece86c0d54ffd32368bd6","abstract_canon_sha256":"243f2fac28b0ebfa3453d65309e8fd075fc3c87695b66eee93c6a749e11bdb4b"},"schema_version":"1.0"},"canonical_sha256":"ca3307eb37a0938f31d1fff369f8a4da9fec6c2d8467456b8781aba74ecc37f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:19.593257Z","signature_b64":"FfGGzNq42NVpNQae3MkHiId2ji7EE+XHAYXOdGOi3ZIG8+wPq6qkCRgDWnwa+0hakAVZyUkBvOmwEx7tRtaIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca3307eb37a0938f31d1fff369f8a4da9fec6c2d8467456b8781aba74ecc37f8","last_reissued_at":"2026-05-18T00:10:19.592461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:19.592461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.01475","source_version":2,"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-18T00:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJie1zMiy2G3z8ZCIp68GTZtC+/1PDhpoM2AcSq97NYn/eugRaP66GAzmMQVZdD6aLFLarMDOThdviO4Jo78CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:03:19.596694Z"},"content_sha256":"031fd54cd120b898236bd05e37b72a15f5e839ab8c7b0f90203f05759ce881ed","schema_version":"1.0","event_id":"sha256:031fd54cd120b898236bd05e37b72a15f5e839ab8c7b0f90203f05759ce881ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZIZQP2ZXUCJY6MOR77ZWT6FE3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aline Parreau, Arnaud Mary, Florent Foucaud, Laurent Beaudou, Michael A. Henning, Peter Dankelmann","submitted_at":"2016-10-05T15:13:58Z","abstract_excerpt":"The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter $d$ and metric dimension $k$. In general, the bound $n\\leq d^k+k$ is known to hold. We prove a bound of the form $n=\\mathcal{O}(kd^2)$ for trees and outerplanar graphs (for trees we determine the best possible bound and the corresponding extremal examples). More generally, for graphs having a tree decomposition of width $w$ and length $\\ell$, we obtain a bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01475","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"},"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-18T00:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+IIHq7BxFXwzKGO/pmCUguYVgRhyehX+UBf34KHX1yvFeAOOikuygnx8X8P149avBHWNQI3VHu6UYTsLUhJpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:03:19.597345Z"},"content_sha256":"e91381eef11959ddb81884e4473aa4c0272ff312570cae67615e111df1f16bc1","schema_version":"1.0","event_id":"sha256:e91381eef11959ddb81884e4473aa4c0272ff312570cae67615e111df1f16bc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/bundle.json","state_url":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/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-25T21:03:19Z","links":{"resolver":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K","bundle":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/bundle.json","state":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZIZQP2ZXUCJY6MOR77ZWT6FE3K","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":"243f2fac28b0ebfa3453d65309e8fd075fc3c87695b66eee93c6a749e11bdb4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-05T15:13:58Z","title_canon_sha256":"eab1febed73023c5a8c08f9502ed77ae0031aaeaf1aece86c0d54ffd32368bd6"},"schema_version":"1.0","source":{"id":"1610.01475","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01475","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01475v2","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01475","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZIZQP2ZXUCJY","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZIZQP2ZXUCJY6MOR","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZIZQP2ZX","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:e91381eef11959ddb81884e4473aa4c0272ff312570cae67615e111df1f16bc1","target":"graph","created_at":"2026-05-18T00:10:19Z","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 metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter $d$ and metric dimension $k$. In general, the bound $n\\leq d^k+k$ is known to hold. We prove a bound of the form $n=\\mathcal{O}(kd^2)$ for trees and outerplanar graphs (for trees we determine the best possible bound and the corresponding extremal examples). More generally, for graphs having a tree decomposition of width $w$ and length $\\ell$, we obtain a bou","authors_text":"Aline Parreau, Arnaud Mary, Florent Foucaud, Laurent Beaudou, Michael A. Henning, Peter Dankelmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-05T15:13:58Z","title":"Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01475","kind":"arxiv","version":2},"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:031fd54cd120b898236bd05e37b72a15f5e839ab8c7b0f90203f05759ce881ed","target":"record","created_at":"2026-05-18T00:10:19Z","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":"243f2fac28b0ebfa3453d65309e8fd075fc3c87695b66eee93c6a749e11bdb4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-05T15:13:58Z","title_canon_sha256":"eab1febed73023c5a8c08f9502ed77ae0031aaeaf1aece86c0d54ffd32368bd6"},"schema_version":"1.0","source":{"id":"1610.01475","kind":"arxiv","version":2}},"canonical_sha256":"ca3307eb37a0938f31d1fff369f8a4da9fec6c2d8467456b8781aba74ecc37f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca3307eb37a0938f31d1fff369f8a4da9fec6c2d8467456b8781aba74ecc37f8","first_computed_at":"2026-05-18T00:10:19.592461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:19.592461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FfGGzNq42NVpNQae3MkHiId2ji7EE+XHAYXOdGOi3ZIG8+wPq6qkCRgDWnwa+0hakAVZyUkBvOmwEx7tRtaIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:19.593257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01475","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:031fd54cd120b898236bd05e37b72a15f5e839ab8c7b0f90203f05759ce881ed","sha256:e91381eef11959ddb81884e4473aa4c0272ff312570cae67615e111df1f16bc1"],"state_sha256":"4de56a61ddce3e2906ec79f44f3a9344df037fbf18a83928cf4278b3ef4ea004"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krk6Fo3TQSFm5PbOsUavjdtet29RjLExDv8ukzvI6bvEmW9gSp4eqpJL2dQjwuWCiV/ciJmcwc24qWrDFXLOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:03:19.599961Z","bundle_sha256":"dff0eb68f5c43ec473dfcae1f9a2ab451c8fd38c33faa65667c901b10bfde786"}}