{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DL6S6EH2H7PFGRGKL3OIVJ2O5V","short_pith_number":"pith:DL6S6EH2","canonical_record":{"source":{"id":"1107.5329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-26T20:54:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9caf09b876c797b8bb6b156b8bf401945d8317c29d5ca37273d0a3751fd234cf","abstract_canon_sha256":"93b65383058a271f669e6b14e054b61cbfb760ead65b358642f5808d87a1dc8f"},"schema_version":"1.0"},"canonical_sha256":"1afd2f10fa3fde5344ca5edc8aa74eed407e1c7a36e94b6f953c55dd7bc2dd85","source":{"kind":"arxiv","id":"1107.5329","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5329","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5329v1","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5329","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"DL6S6EH2H7PF","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DL6S6EH2H7PFGRGK","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DL6S6EH2","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DL6S6EH2H7PFGRGKL3OIVJ2O5V","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-26T20:54:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9caf09b876c797b8bb6b156b8bf401945d8317c29d5ca37273d0a3751fd234cf","abstract_canon_sha256":"93b65383058a271f669e6b14e054b61cbfb760ead65b358642f5808d87a1dc8f"},"schema_version":"1.0"},"canonical_sha256":"1afd2f10fa3fde5344ca5edc8aa74eed407e1c7a36e94b6f953c55dd7bc2dd85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:52.271235Z","signature_b64":"lGlSU9hZ6gvc9br1w2nqbmM7j3ROlLFwzIaIqxjZMHiXDBps56xXFRqGPOCCDxPfrYWppQSDZs/XX5uKBaAtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1afd2f10fa3fde5344ca5edc8aa74eed407e1c7a36e94b6f953c55dd7bc2dd85","last_reissued_at":"2026-05-18T04:16:52.270587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:52.270587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5329","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-18T04:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWf0HlGj5XKaijU9Z33/KeRnIpckx5dEtfh1+U8xMTjAJPL08ljFZgX94UDcAd0RRuDBTs0JDQMI457BrbTbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:53:16.625573Z"},"content_sha256":"f55fda07b751c29a7868a626019bb364faf251232411c7083082b146d1ec66ec","schema_version":"1.0","event_id":"sha256:f55fda07b751c29a7868a626019bb364faf251232411c7083082b146d1ec66ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DL6S6EH2H7PFGRGKL3OIVJ2O5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matroidal Degree-Bounded Minimum Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Rico Zenklusen","submitted_at":"2011-07-26T20:54:16Z","abstract_excerpt":"We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints. A famous example thereof is the classical degree-constrained MST problem, where for every vertex v, a simple upper bound on the degree is imposed. Iterative rounding/relaxation algorithms became the tool of choice for degree-bounded network design problems. A cornerstone for this development was the work of Singh and Lau, who showed for the degree-bounded MST problem how to find a spanning tree violating each degr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5329","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-18T04:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87ypRtOkZ1sZBYuEM2YdubKEKXI72eTjrgVur9H0B01k92527956cn3NYqbq/J65ZMEjLqb2hbim/OvlgYM1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:53:16.625976Z"},"content_sha256":"115843aa9d508d44060bb21f132c00e9ce851722f66a0a852ab974c62b4fce6c","schema_version":"1.0","event_id":"sha256:115843aa9d508d44060bb21f132c00e9ce851722f66a0a852ab974c62b4fce6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DL6S6EH2H7PFGRGKL3OIVJ2O5V/bundle.json","state_url":"https://pith.science/pith/DL6S6EH2H7PFGRGKL3OIVJ2O5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DL6S6EH2H7PFGRGKL3OIVJ2O5V/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-31T06:53:16Z","links":{"resolver":"https://pith.science/pith/DL6S6EH2H7PFGRGKL3OIVJ2O5V","bundle":"https://pith.science/pith/DL6S6EH2H7PFGRGKL3OIVJ2O5V/bundle.json","state":"https://pith.science/pith/DL6S6EH2H7PFGRGKL3OIVJ2O5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DL6S6EH2H7PFGRGKL3OIVJ2O5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DL6S6EH2H7PFGRGKL3OIVJ2O5V","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":"93b65383058a271f669e6b14e054b61cbfb760ead65b358642f5808d87a1dc8f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-26T20:54:16Z","title_canon_sha256":"9caf09b876c797b8bb6b156b8bf401945d8317c29d5ca37273d0a3751fd234cf"},"schema_version":"1.0","source":{"id":"1107.5329","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5329","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5329v1","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5329","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"DL6S6EH2H7PF","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DL6S6EH2H7PFGRGK","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DL6S6EH2","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:115843aa9d508d44060bb21f132c00e9ce851722f66a0a852ab974c62b4fce6c","target":"graph","created_at":"2026-05-18T04:16:52Z","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":"We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints. A famous example thereof is the classical degree-constrained MST problem, where for every vertex v, a simple upper bound on the degree is imposed. Iterative rounding/relaxation algorithms became the tool of choice for degree-bounded network design problems. A cornerstone for this development was the work of Singh and Lau, who showed for the degree-bounded MST problem how to find a spanning tree violating each degr","authors_text":"Rico Zenklusen","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-26T20:54:16Z","title":"Matroidal Degree-Bounded Minimum Spanning Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5329","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:f55fda07b751c29a7868a626019bb364faf251232411c7083082b146d1ec66ec","target":"record","created_at":"2026-05-18T04:16:52Z","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":"93b65383058a271f669e6b14e054b61cbfb760ead65b358642f5808d87a1dc8f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-26T20:54:16Z","title_canon_sha256":"9caf09b876c797b8bb6b156b8bf401945d8317c29d5ca37273d0a3751fd234cf"},"schema_version":"1.0","source":{"id":"1107.5329","kind":"arxiv","version":1}},"canonical_sha256":"1afd2f10fa3fde5344ca5edc8aa74eed407e1c7a36e94b6f953c55dd7bc2dd85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1afd2f10fa3fde5344ca5edc8aa74eed407e1c7a36e94b6f953c55dd7bc2dd85","first_computed_at":"2026-05-18T04:16:52.270587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:52.270587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lGlSU9hZ6gvc9br1w2nqbmM7j3ROlLFwzIaIqxjZMHiXDBps56xXFRqGPOCCDxPfrYWppQSDZs/XX5uKBaAtAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:52.271235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5329","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f55fda07b751c29a7868a626019bb364faf251232411c7083082b146d1ec66ec","sha256:115843aa9d508d44060bb21f132c00e9ce851722f66a0a852ab974c62b4fce6c"],"state_sha256":"068a0da35d3ea250fc90050622c8cdfad8ce172201682b2a7b995b8d6c58a6dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQHM/lR3lc9376XSFjAdomI/l51ADrRKqMlQc8AIG6ANJ1AKiSRk+p5MzCfd9pI9LVA95NuBoudJNf1NqmeGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:53:16.628513Z","bundle_sha256":"d846a825909137f32bf45e42ff65b9ce13ed1f34100b20a9666f0b6fad5924f7"}}