{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6MUEZQAB3EBCMQLNGJ5CHZMF5K","short_pith_number":"pith:6MUEZQAB","canonical_record":{"source":{"id":"1905.12477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-05-29T14:12:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"da0e1d4687e591a6a8313abfd0f694da61fa21e81ca393f5bad3b5223e021ddf","abstract_canon_sha256":"96fd3ff0b08caa5fbcd0f0e4f309c1a146a1baad99f62666b7607d41a56c1f00"},"schema_version":"1.0"},"canonical_sha256":"f3284cc001d90226416d327a23e585eaaf730e8055e182089a8b18ff2a8eeb51","source":{"kind":"arxiv","id":"1905.12477","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12477","created_at":"2026-05-17T23:44:44Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12477v1","created_at":"2026-05-17T23:44:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12477","created_at":"2026-05-17T23:44:44Z"},{"alias_kind":"pith_short_12","alias_value":"6MUEZQAB3EBC","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6MUEZQAB3EBCMQLN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6MUEZQAB","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6MUEZQAB3EBCMQLNGJ5CHZMF5K","target":"record","payload":{"canonical_record":{"source":{"id":"1905.12477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-05-29T14:12:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"da0e1d4687e591a6a8313abfd0f694da61fa21e81ca393f5bad3b5223e021ddf","abstract_canon_sha256":"96fd3ff0b08caa5fbcd0f0e4f309c1a146a1baad99f62666b7607d41a56c1f00"},"schema_version":"1.0"},"canonical_sha256":"f3284cc001d90226416d327a23e585eaaf730e8055e182089a8b18ff2a8eeb51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:44.146556Z","signature_b64":"5Z3IzvWDNguM6iepmA3vxDsDD9qxyI1PK6ndaiBfiMwqqXSg+OAJPefCFwziR8oI4tFSsK1w+QTZLPOrehpVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3284cc001d90226416d327a23e585eaaf730e8055e182089a8b18ff2a8eeb51","last_reissued_at":"2026-05-17T23:44:44.145899Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:44.145899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.12477","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-17T23:44:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZbjs9Mhe2l3xQkyKi5r47TEIsovKplSl5XrKmmamttdgYUqb+9jFFFVQGHtSUN96O7blpRZ1ayz3qbh5ub6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:12:59.541391Z"},"content_sha256":"c0d365928ba6ff7054f0c8c6aabea7fa7806ccfea13764949290910a39b262c1","schema_version":"1.0","event_id":"sha256:c0d365928ba6ff7054f0c8c6aabea7fa7806ccfea13764949290910a39b262c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6MUEZQAB3EBCMQLNGJ5CHZMF5K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Understanding the Effectiveness of Data Reduction in Public Transportation Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Martin Schirneck, Philipp Fischbeck, Thomas Bl\\\"asius, Tobias Friedrich","submitted_at":"2019-05-29T14:12:42Z","abstract_excerpt":"Given a public transportation network of stations and connections, we want to find a minimum subset of stations such that each connection runs through a selected station. Although this problem is NP-hard in general, real-world instances are regularly solved almost completely by a set of simple reduction rules. To explain this behavior, we view transportation networks as hitting set instances and identify two characteristic properties, locality and heterogeneity. We then devise a randomized model to generate hitting set instances with adjustable properties. While the heterogeneity does influenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12477","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-17T23:44:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/A0y8a493QOuW0Jx3B2b88VRQBR0gytgLsCoC88/3EXo2OQMF4tRTE6l9LE5u5KYliqPMCwY88EhZt1TXmwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:12:59.542070Z"},"content_sha256":"c9138cdfb3901cd9ea037e1d6502f977eb73066aa9cb6cb78a215ffca1ea62b3","schema_version":"1.0","event_id":"sha256:c9138cdfb3901cd9ea037e1d6502f977eb73066aa9cb6cb78a215ffca1ea62b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MUEZQAB3EBCMQLNGJ5CHZMF5K/bundle.json","state_url":"https://pith.science/pith/6MUEZQAB3EBCMQLNGJ5CHZMF5K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MUEZQAB3EBCMQLNGJ5CHZMF5K/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-26T14:12:59Z","links":{"resolver":"https://pith.science/pith/6MUEZQAB3EBCMQLNGJ5CHZMF5K","bundle":"https://pith.science/pith/6MUEZQAB3EBCMQLNGJ5CHZMF5K/bundle.json","state":"https://pith.science/pith/6MUEZQAB3EBCMQLNGJ5CHZMF5K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MUEZQAB3EBCMQLNGJ5CHZMF5K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6MUEZQAB3EBCMQLNGJ5CHZMF5K","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":"96fd3ff0b08caa5fbcd0f0e4f309c1a146a1baad99f62666b7607d41a56c1f00","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-05-29T14:12:42Z","title_canon_sha256":"da0e1d4687e591a6a8313abfd0f694da61fa21e81ca393f5bad3b5223e021ddf"},"schema_version":"1.0","source":{"id":"1905.12477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12477","created_at":"2026-05-17T23:44:44Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12477v1","created_at":"2026-05-17T23:44:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12477","created_at":"2026-05-17T23:44:44Z"},{"alias_kind":"pith_short_12","alias_value":"6MUEZQAB3EBC","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6MUEZQAB3EBCMQLN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6MUEZQAB","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:c9138cdfb3901cd9ea037e1d6502f977eb73066aa9cb6cb78a215ffca1ea62b3","target":"graph","created_at":"2026-05-17T23:44:44Z","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":"Given a public transportation network of stations and connections, we want to find a minimum subset of stations such that each connection runs through a selected station. Although this problem is NP-hard in general, real-world instances are regularly solved almost completely by a set of simple reduction rules. To explain this behavior, we view transportation networks as hitting set instances and identify two characteristic properties, locality and heterogeneity. We then devise a randomized model to generate hitting set instances with adjustable properties. While the heterogeneity does influenc","authors_text":"Martin Schirneck, Philipp Fischbeck, Thomas Bl\\\"asius, Tobias Friedrich","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-05-29T14:12:42Z","title":"Understanding the Effectiveness of Data Reduction in Public Transportation Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12477","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:c0d365928ba6ff7054f0c8c6aabea7fa7806ccfea13764949290910a39b262c1","target":"record","created_at":"2026-05-17T23:44:44Z","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":"96fd3ff0b08caa5fbcd0f0e4f309c1a146a1baad99f62666b7607d41a56c1f00","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-05-29T14:12:42Z","title_canon_sha256":"da0e1d4687e591a6a8313abfd0f694da61fa21e81ca393f5bad3b5223e021ddf"},"schema_version":"1.0","source":{"id":"1905.12477","kind":"arxiv","version":1}},"canonical_sha256":"f3284cc001d90226416d327a23e585eaaf730e8055e182089a8b18ff2a8eeb51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3284cc001d90226416d327a23e585eaaf730e8055e182089a8b18ff2a8eeb51","first_computed_at":"2026-05-17T23:44:44.145899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:44.145899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Z3IzvWDNguM6iepmA3vxDsDD9qxyI1PK6ndaiBfiMwqqXSg+OAJPefCFwziR8oI4tFSsK1w+QTZLPOrehpVBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:44.146556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0d365928ba6ff7054f0c8c6aabea7fa7806ccfea13764949290910a39b262c1","sha256:c9138cdfb3901cd9ea037e1d6502f977eb73066aa9cb6cb78a215ffca1ea62b3"],"state_sha256":"e7a1bf643b3d705cab87cc312ae90321287c40938e20ffbeed5df90963fd5df0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Q8djZC6aJNu5S/W1JiEF2OgcaDoUFVm01MyUBDCm/AQPjbdoMvVKKr2FQRc3gvCyHjczA+VOvkYjGs4IhNuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:12:59.546006Z","bundle_sha256":"ce5743b594df1d401d5f460ffbcf8d9f98be5be53ec2e4e78d5e4d1d7386e55e"}}