{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ILFXPAOSUGEGJ6FLIX3WMG3QFO","short_pith_number":"pith:ILFXPAOS","canonical_record":{"source":{"id":"2506.23638","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-30T09:05:02Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"46dcacf03581c00f2fa95c94219207c04b8ccd804d572b94a727ae5ecd4ca2a2","abstract_canon_sha256":"b89999b4594a4f3efdbd1f31c408a823f066f82a06d0954f197488ced51b1dcb"},"schema_version":"1.0"},"canonical_sha256":"42cb7781d2a18864f8ab45f7661b702b88bcb2bff571e95199a72dd795a85c51","source":{"kind":"arxiv","id":"2506.23638","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.23638","created_at":"2026-07-05T11:30:03Z"},{"alias_kind":"arxiv_version","alias_value":"2506.23638v2","created_at":"2026-07-05T11:30:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23638","created_at":"2026-07-05T11:30:03Z"},{"alias_kind":"pith_short_12","alias_value":"ILFXPAOSUGEG","created_at":"2026-07-05T11:30:03Z"},{"alias_kind":"pith_short_16","alias_value":"ILFXPAOSUGEGJ6FL","created_at":"2026-07-05T11:30:03Z"},{"alias_kind":"pith_short_8","alias_value":"ILFXPAOS","created_at":"2026-07-05T11:30:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ILFXPAOSUGEGJ6FLIX3WMG3QFO","target":"record","payload":{"canonical_record":{"source":{"id":"2506.23638","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-30T09:05:02Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"46dcacf03581c00f2fa95c94219207c04b8ccd804d572b94a727ae5ecd4ca2a2","abstract_canon_sha256":"b89999b4594a4f3efdbd1f31c408a823f066f82a06d0954f197488ced51b1dcb"},"schema_version":"1.0"},"canonical_sha256":"42cb7781d2a18864f8ab45f7661b702b88bcb2bff571e95199a72dd795a85c51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:03.960870Z","signature_b64":"tic8S94Rd36VSF8UmnoMeS7q6Zn0WE4m5ntnONlOkA7iTUdv/ZXpaqmU3OxE6FP4AcpIQaOF649AqDvmEIGJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42cb7781d2a18864f8ab45f7661b702b88bcb2bff571e95199a72dd795a85c51","last_reissued_at":"2026-07-05T11:30:03.960406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:03.960406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.23638","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-07-05T11:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWwTebt3dvG+6P7O0Hfyx6SocOhF0FDZ4kXH8Qu18QWsWSZSWyAdI5ehnREVRIctSH2UZyNz+SIbyofyDz+JCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T11:08:01.525915Z"},"content_sha256":"647f043cd3167bc057f90348f95ac69d7a0bf1eeb3808cc26f81e73015a883b8","schema_version":"1.0","event_id":"sha256:647f043cd3167bc057f90348f95ac69d7a0bf1eeb3808cc26f81e73015a883b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ILFXPAOSUGEGJ6FLIX3WMG3QFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Approximations for General Spanner Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Fritz B\\\"okler, Henning Jasper, Markus Chimani","submitted_at":"2025-06-30T09:05:02Z","abstract_excerpt":"Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths w.r.t. the edge lengths. For multiplicative alpha-spanners (where demands equal alpha times the original distances) and assuming that each edge's weight equals its length, the simple Greedy heuristic by Alth\\\"ofer et al. (1993) is known to yield strong solutions, both in theory and practice. To obtain guarantees in more general settings, recent approximatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23638","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.23638/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbDz9c9fCEaWmlNEHmxfmsj2Pqav+fsgQ0BAmCctZRnTkqRx9rSlslawwXswFmbZtCQi9KIc5ggyaedmvnmMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T11:08:01.526244Z"},"content_sha256":"935c285fbcfe0abbc9f2bf57dcefbd538d7a9ce2f3050a648485b12d101d8040","schema_version":"1.0","event_id":"sha256:935c285fbcfe0abbc9f2bf57dcefbd538d7a9ce2f3050a648485b12d101d8040"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILFXPAOSUGEGJ6FLIX3WMG3QFO/bundle.json","state_url":"https://pith.science/pith/ILFXPAOSUGEGJ6FLIX3WMG3QFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILFXPAOSUGEGJ6FLIX3WMG3QFO/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-08-20T11:08:01Z","links":{"resolver":"https://pith.science/pith/ILFXPAOSUGEGJ6FLIX3WMG3QFO","bundle":"https://pith.science/pith/ILFXPAOSUGEGJ6FLIX3WMG3QFO/bundle.json","state":"https://pith.science/pith/ILFXPAOSUGEGJ6FLIX3WMG3QFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILFXPAOSUGEGJ6FLIX3WMG3QFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ILFXPAOSUGEGJ6FLIX3WMG3QFO","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":"b89999b4594a4f3efdbd1f31c408a823f066f82a06d0954f197488ced51b1dcb","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-30T09:05:02Z","title_canon_sha256":"46dcacf03581c00f2fa95c94219207c04b8ccd804d572b94a727ae5ecd4ca2a2"},"schema_version":"1.0","source":{"id":"2506.23638","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.23638","created_at":"2026-07-05T11:30:03Z"},{"alias_kind":"arxiv_version","alias_value":"2506.23638v2","created_at":"2026-07-05T11:30:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23638","created_at":"2026-07-05T11:30:03Z"},{"alias_kind":"pith_short_12","alias_value":"ILFXPAOSUGEG","created_at":"2026-07-05T11:30:03Z"},{"alias_kind":"pith_short_16","alias_value":"ILFXPAOSUGEGJ6FL","created_at":"2026-07-05T11:30:03Z"},{"alias_kind":"pith_short_8","alias_value":"ILFXPAOS","created_at":"2026-07-05T11:30:03Z"}],"graph_snapshots":[{"event_id":"sha256:935c285fbcfe0abbc9f2bf57dcefbd538d7a9ce2f3050a648485b12d101d8040","target":"graph","created_at":"2026-07-05T11:30:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.23638/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths w.r.t. the edge lengths. For multiplicative alpha-spanners (where demands equal alpha times the original distances) and assuming that each edge's weight equals its length, the simple Greedy heuristic by Alth\\\"ofer et al. (1993) is known to yield strong solutions, both in theory and practice. To obtain guarantees in more general settings, recent approximatio","authors_text":"Fritz B\\\"okler, Henning Jasper, Markus Chimani","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-30T09:05:02Z","title":"Simple Approximations for General Spanner Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23638","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:647f043cd3167bc057f90348f95ac69d7a0bf1eeb3808cc26f81e73015a883b8","target":"record","created_at":"2026-07-05T11:30:03Z","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":"b89999b4594a4f3efdbd1f31c408a823f066f82a06d0954f197488ced51b1dcb","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-30T09:05:02Z","title_canon_sha256":"46dcacf03581c00f2fa95c94219207c04b8ccd804d572b94a727ae5ecd4ca2a2"},"schema_version":"1.0","source":{"id":"2506.23638","kind":"arxiv","version":2}},"canonical_sha256":"42cb7781d2a18864f8ab45f7661b702b88bcb2bff571e95199a72dd795a85c51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42cb7781d2a18864f8ab45f7661b702b88bcb2bff571e95199a72dd795a85c51","first_computed_at":"2026-07-05T11:30:03.960406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:30:03.960406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tic8S94Rd36VSF8UmnoMeS7q6Zn0WE4m5ntnONlOkA7iTUdv/ZXpaqmU3OxE6FP4AcpIQaOF649AqDvmEIGJDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:30:03.960870Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.23638","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:647f043cd3167bc057f90348f95ac69d7a0bf1eeb3808cc26f81e73015a883b8","sha256:935c285fbcfe0abbc9f2bf57dcefbd538d7a9ce2f3050a648485b12d101d8040"],"state_sha256":"246e22af4f3fa25710fdd576e5ded9cf451dddb30c337d5498e60ae3229db87c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aefVLQzMDlAGzBCoi1kWvaCBPImG2SaDfowkfMZl7BZVM6bZcxWB4BXSdRI4zGJf5x17ZslC6QFZtcmH97LbCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T11:08:01.529285Z","bundle_sha256":"a55f0572638e49aa4068399312255ddd67b38fb8f64816f224127010be82eaf4"}}