{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PYMIICOGQ5UPTT6SO4HXLT6KKY","short_pith_number":"pith:PYMIICOG","canonical_record":{"source":{"id":"1810.11700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-27T20:37:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"547704e24daca2e8f7443dc9962c53994149c2989488102784839a89c49e14d4","abstract_canon_sha256":"1339dc71395f23f1d11684399eb58eb06728aaa516b503665136791d38d46653"},"schema_version":"1.0"},"canonical_sha256":"7e188409c68768f9cfd2770f75cfca563a3a257098dc7523f9cb9082abfb647d","source":{"kind":"arxiv","id":"1810.11700","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11700","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11700v2","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11700","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"PYMIICOGQ5UP","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PYMIICOGQ5UPTT6S","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PYMIICOG","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PYMIICOGQ5UPTT6SO4HXLT6KKY","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-27T20:37:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"547704e24daca2e8f7443dc9962c53994149c2989488102784839a89c49e14d4","abstract_canon_sha256":"1339dc71395f23f1d11684399eb58eb06728aaa516b503665136791d38d46653"},"schema_version":"1.0"},"canonical_sha256":"7e188409c68768f9cfd2770f75cfca563a3a257098dc7523f9cb9082abfb647d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:39.096984Z","signature_b64":"u+g8QDcM4Fkr0RPkK149Bo7rDSb//2pVgQFVpA+/Og1XBamSOdqNFUk0yge08VQ0OCHVPrkakJJ0b93QxqqNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e188409c68768f9cfd2770f75cfca563a3a257098dc7523f9cb9082abfb647d","last_reissued_at":"2026-05-17T23:54:39.096468Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:39.096468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11700","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-17T23:54:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLw2bS0hNTZydV7RdOPDRSSJjwYjDhLZ7buLoXS9xTOOs7LQ8bID6lL8ISepwNJt/FQmDFIwB3aAJSxd4So4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:25:43.867647Z"},"content_sha256":"b7fb9babd5b0df92e273fbf49e5aceb21faada0dd028b8a65127bed713f72716","schema_version":"1.0","event_id":"sha256:b7fb9babd5b0df92e273fbf49e5aceb21faada0dd028b8a65127bed713f72716"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PYMIICOGQ5UPTT6SO4HXLT6KKY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Reload Cost Graph Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Didem G\\\"oz\\\"upek, Dimitrios M. Thilikos, Julien Baste, Mordechai Shalom","submitted_at":"2018-10-27T20:37:42Z","abstract_excerpt":"The concept of Reload cost in a graph refers to the cost that occurs while traversing a vertex via two of its incident edges. This cost is uniquely determined by the colors of the two edges. This concept has various applications in transportation networks, communication networks, and energy distribution networks. Various problems using this model are defined and studied in the literature. The problem of finding a spanning tree whose diameter with respect to the reload costs is the smallest possible, the problems of finding a path, trail or walk with minimum total reload cost between two given "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11700","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-17T23:54:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UDL4Vo+E0pWUnWXnaxpAxoQ9Sh59tRPQ1dAg8OBu7vTOStJpoZrO+zoINuHDERDnb2NXewq66IWZT9D/5JYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:25:43.868400Z"},"content_sha256":"f1619f44fee64c7bc4ef8f9110d3f4724da4a95915cec1a2aa72f1396ae6eaeb","schema_version":"1.0","event_id":"sha256:f1619f44fee64c7bc4ef8f9110d3f4724da4a95915cec1a2aa72f1396ae6eaeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYMIICOGQ5UPTT6SO4HXLT6KKY/bundle.json","state_url":"https://pith.science/pith/PYMIICOGQ5UPTT6SO4HXLT6KKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYMIICOGQ5UPTT6SO4HXLT6KKY/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-25T18:25:43Z","links":{"resolver":"https://pith.science/pith/PYMIICOGQ5UPTT6SO4HXLT6KKY","bundle":"https://pith.science/pith/PYMIICOGQ5UPTT6SO4HXLT6KKY/bundle.json","state":"https://pith.science/pith/PYMIICOGQ5UPTT6SO4HXLT6KKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYMIICOGQ5UPTT6SO4HXLT6KKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PYMIICOGQ5UPTT6SO4HXLT6KKY","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":"1339dc71395f23f1d11684399eb58eb06728aaa516b503665136791d38d46653","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-27T20:37:42Z","title_canon_sha256":"547704e24daca2e8f7443dc9962c53994149c2989488102784839a89c49e14d4"},"schema_version":"1.0","source":{"id":"1810.11700","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11700","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11700v2","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11700","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"PYMIICOGQ5UP","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PYMIICOGQ5UPTT6S","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PYMIICOG","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:f1619f44fee64c7bc4ef8f9110d3f4724da4a95915cec1a2aa72f1396ae6eaeb","target":"graph","created_at":"2026-05-17T23:54:39Z","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 concept of Reload cost in a graph refers to the cost that occurs while traversing a vertex via two of its incident edges. This cost is uniquely determined by the colors of the two edges. This concept has various applications in transportation networks, communication networks, and energy distribution networks. Various problems using this model are defined and studied in the literature. The problem of finding a spanning tree whose diameter with respect to the reload costs is the smallest possible, the problems of finding a path, trail or walk with minimum total reload cost between two given ","authors_text":"Didem G\\\"oz\\\"upek, Dimitrios M. Thilikos, Julien Baste, Mordechai Shalom","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-27T20:37:42Z","title":"Minimum Reload Cost Graph Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11700","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:b7fb9babd5b0df92e273fbf49e5aceb21faada0dd028b8a65127bed713f72716","target":"record","created_at":"2026-05-17T23:54:39Z","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":"1339dc71395f23f1d11684399eb58eb06728aaa516b503665136791d38d46653","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-27T20:37:42Z","title_canon_sha256":"547704e24daca2e8f7443dc9962c53994149c2989488102784839a89c49e14d4"},"schema_version":"1.0","source":{"id":"1810.11700","kind":"arxiv","version":2}},"canonical_sha256":"7e188409c68768f9cfd2770f75cfca563a3a257098dc7523f9cb9082abfb647d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e188409c68768f9cfd2770f75cfca563a3a257098dc7523f9cb9082abfb647d","first_computed_at":"2026-05-17T23:54:39.096468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:39.096468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u+g8QDcM4Fkr0RPkK149Bo7rDSb//2pVgQFVpA+/Og1XBamSOdqNFUk0yge08VQ0OCHVPrkakJJ0b93QxqqNBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:39.096984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11700","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7fb9babd5b0df92e273fbf49e5aceb21faada0dd028b8a65127bed713f72716","sha256:f1619f44fee64c7bc4ef8f9110d3f4724da4a95915cec1a2aa72f1396ae6eaeb"],"state_sha256":"64c3621d0d4602350cb8c935549601d94df97a8e54ad21dd79ff714f0fcc230a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+wOK+FgSkPRFXZzqaT5ptjNKo2FtHwogNEY0rlDFJSY3HfRULyRtyPBUuNe5K3bGoQYRVHaBTwx0Pq7hz3GAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:25:43.872659Z","bundle_sha256":"34a414b46f69d3dc8f337ad55e006654c94fe4abb85c650d1b0fc108fd3f371b"}}