{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PLH5S7YAJQVRBWJOCAVYNPLOPS","short_pith_number":"pith:PLH5S7YA","schema_version":"1.0","canonical_sha256":"7acfd97f004c2b10d92e102b86bd6e7c815b2f41c232345e81d4ae67df85e429","source":{"kind":"arxiv","id":"1309.5172","version":1},"attestation_state":"computed","paper":{"title":"Augmenting graphs to minimize the diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabrizio Frati, Joachim Gudmundsson, Luke Mathieson, Serge Gaspers","submitted_at":"2013-09-20T04:57:52Z","abstract_excerpt":"We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main result is an FPT 4-approximation algorithm for the problem."},"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":"1309.5172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-20T04:57:52Z","cross_cats_sorted":[],"title_canon_sha256":"3fa9ed7a9c2531744e7c8e3e35dbd3781c73ebeda46d5071a1da68bd2c282f9f","abstract_canon_sha256":"09654ba5f12c15f2c563cbf7e9374f338d3e07c8764ac9d5490745292edb1b69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:47.390264Z","signature_b64":"Asl48DBy+xTJvZGsF/N6jfxuh1PQwFz1IfPgMJjQbTRmkp49U3edqgRz39glOa54uXvUy2FLmfjHNHPDHikDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7acfd97f004c2b10d92e102b86bd6e7c815b2f41c232345e81d4ae67df85e429","last_reissued_at":"2026-05-18T03:12:47.389619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:47.389619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Augmenting graphs to minimize the diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabrizio Frati, Joachim Gudmundsson, Luke Mathieson, Serge Gaspers","submitted_at":"2013-09-20T04:57:52Z","abstract_excerpt":"We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main result is an FPT 4-approximation algorithm for the problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5172","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":"1309.5172","created_at":"2026-05-18T03:12:47.389725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5172v1","created_at":"2026-05-18T03:12:47.389725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5172","created_at":"2026-05-18T03:12:47.389725+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLH5S7YAJQVR","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLH5S7YAJQVRBWJO","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLH5S7YA","created_at":"2026-05-18T12:27:54.935989+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/PLH5S7YAJQVRBWJOCAVYNPLOPS","json":"https://pith.science/pith/PLH5S7YAJQVRBWJOCAVYNPLOPS.json","graph_json":"https://pith.science/api/pith-number/PLH5S7YAJQVRBWJOCAVYNPLOPS/graph.json","events_json":"https://pith.science/api/pith-number/PLH5S7YAJQVRBWJOCAVYNPLOPS/events.json","paper":"https://pith.science/paper/PLH5S7YA"},"agent_actions":{"view_html":"https://pith.science/pith/PLH5S7YAJQVRBWJOCAVYNPLOPS","download_json":"https://pith.science/pith/PLH5S7YAJQVRBWJOCAVYNPLOPS.json","view_paper":"https://pith.science/paper/PLH5S7YA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5172&json=true","fetch_graph":"https://pith.science/api/pith-number/PLH5S7YAJQVRBWJOCAVYNPLOPS/graph.json","fetch_events":"https://pith.science/api/pith-number/PLH5S7YAJQVRBWJOCAVYNPLOPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLH5S7YAJQVRBWJOCAVYNPLOPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLH5S7YAJQVRBWJOCAVYNPLOPS/action/storage_attestation","attest_author":"https://pith.science/pith/PLH5S7YAJQVRBWJOCAVYNPLOPS/action/author_attestation","sign_citation":"https://pith.science/pith/PLH5S7YAJQVRBWJOCAVYNPLOPS/action/citation_signature","submit_replication":"https://pith.science/pith/PLH5S7YAJQVRBWJOCAVYNPLOPS/action/replication_record"}},"created_at":"2026-05-18T03:12:47.389725+00:00","updated_at":"2026-05-18T03:12:47.389725+00:00"}