{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GRJ2P6I2QDI6UUFXJMQMOGSTCI","short_pith_number":"pith:GRJ2P6I2","canonical_record":{"source":{"id":"1109.0787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-05T02:16:17Z","cross_cats_sorted":["cs.DM","math.MG"],"title_canon_sha256":"a7956d6a3207b27ad7206353f01cab5447015cecd1855a65c49b6a0a81974678","abstract_canon_sha256":"64846956acd65397887c860374834dca37838ceec07bac6021f012445a082ff7"},"schema_version":"1.0"},"canonical_sha256":"3453a7f91a80d1ea50b74b20c71a53120a8b44c4804b8c33c6d65c8ff159c661","source":{"kind":"arxiv","id":"1109.0787","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0787","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0787v1","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0787","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"GRJ2P6I2QDI6","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GRJ2P6I2QDI6UUFX","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GRJ2P6I2","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GRJ2P6I2QDI6UUFXJMQMOGSTCI","target":"record","payload":{"canonical_record":{"source":{"id":"1109.0787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-05T02:16:17Z","cross_cats_sorted":["cs.DM","math.MG"],"title_canon_sha256":"a7956d6a3207b27ad7206353f01cab5447015cecd1855a65c49b6a0a81974678","abstract_canon_sha256":"64846956acd65397887c860374834dca37838ceec07bac6021f012445a082ff7"},"schema_version":"1.0"},"canonical_sha256":"3453a7f91a80d1ea50b74b20c71a53120a8b44c4804b8c33c6d65c8ff159c661","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:06.652130Z","signature_b64":"T/k/n2Y+nJgldDenkmWhw2ayvs2voBZlqVGtj9aMl1fQI0tv7DAvstY0i5XMWUuHy/IClIfdJZN63W+6oI6NCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3453a7f91a80d1ea50b74b20c71a53120a8b44c4804b8c33c6d65c8ff159c661","last_reissued_at":"2026-05-18T04:14:06.651581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:06.651581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.0787","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:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/BaYYwP/mZ3QtOYHQHHM+J4p5PvT4m0ij1ncK16UrFow124ilg8CIMlcENzbdZnXuDFGur9qfB7ydCRJg9BjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:02:49.511885Z"},"content_sha256":"4879233c45888519e2ebf85b7c2a882067d5ac9518cbb3be870257a257bde02a","schema_version":"1.0","event_id":"sha256:4879233c45888519e2ebf85b7c2a882067d5ac9518cbb3be870257a257bde02a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GRJ2P6I2QDI6UUFXJMQMOGSTCI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.MG"],"primary_cat":"math.CO","authors_text":"Naoki Katoh, Shin-ichi Tanigawa","submitted_at":"2011-09-05T02:16:17Z","abstract_excerpt":"As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset $R=\\{r1,..., r_t\\}$ of vertices in $V$, and a matroid ${\\cal M}$ on $R$. We prove a necessary and sufficient condition for $G$ to be decomposed into $t$ edge-disjoint subgraphs $G_1=(V_1,T_1),..., G_t=(V_t,T_t)$ such that (i) for each $i$, $G_i$ is a tree with $r_i\\in V_i$, and (ii) for each $v\\in V$, the multiset $\\{r_i\\in R\\mid v\\in V_i\\}$ is a base of ${\\cal M}$. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0787","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:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rT7DL4Cq5L3sTrP23w8fglFsanRVEmoKhmgy1WW+f9RxJSJCu6idvBWuI+PHBfc6JU1BWczRLS9dJj+Nb8SqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:02:49.512240Z"},"content_sha256":"24c96c8ba902805521a2ed20b559e3a987aec8eb495509021adbc0de8e6686be","schema_version":"1.0","event_id":"sha256:24c96c8ba902805521a2ed20b559e3a987aec8eb495509021adbc0de8e6686be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRJ2P6I2QDI6UUFXJMQMOGSTCI/bundle.json","state_url":"https://pith.science/pith/GRJ2P6I2QDI6UUFXJMQMOGSTCI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRJ2P6I2QDI6UUFXJMQMOGSTCI/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-06-05T14:02:49Z","links":{"resolver":"https://pith.science/pith/GRJ2P6I2QDI6UUFXJMQMOGSTCI","bundle":"https://pith.science/pith/GRJ2P6I2QDI6UUFXJMQMOGSTCI/bundle.json","state":"https://pith.science/pith/GRJ2P6I2QDI6UUFXJMQMOGSTCI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRJ2P6I2QDI6UUFXJMQMOGSTCI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GRJ2P6I2QDI6UUFXJMQMOGSTCI","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":"64846956acd65397887c860374834dca37838ceec07bac6021f012445a082ff7","cross_cats_sorted":["cs.DM","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-05T02:16:17Z","title_canon_sha256":"a7956d6a3207b27ad7206353f01cab5447015cecd1855a65c49b6a0a81974678"},"schema_version":"1.0","source":{"id":"1109.0787","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0787","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0787v1","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0787","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"GRJ2P6I2QDI6","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GRJ2P6I2QDI6UUFX","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GRJ2P6I2","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:24c96c8ba902805521a2ed20b559e3a987aec8eb495509021adbc0de8e6686be","target":"graph","created_at":"2026-05-18T04:14:06Z","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":"As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset $R=\\{r1,..., r_t\\}$ of vertices in $V$, and a matroid ${\\cal M}$ on $R$. We prove a necessary and sufficient condition for $G$ to be decomposed into $t$ edge-disjoint subgraphs $G_1=(V_1,T_1),..., G_t=(V_t,T_t)$ such that (i) for each $i$, $G_i$ is a tree with $r_i\\in V_i$, and (ii) for each $v\\in V$, the multiset $\\{r_i\\in R\\mid v\\in V_i\\}$ is a base of ${\\cal M}$. I","authors_text":"Naoki Katoh, Shin-ichi Tanigawa","cross_cats":["cs.DM","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-05T02:16:17Z","title":"Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0787","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:4879233c45888519e2ebf85b7c2a882067d5ac9518cbb3be870257a257bde02a","target":"record","created_at":"2026-05-18T04:14:06Z","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":"64846956acd65397887c860374834dca37838ceec07bac6021f012445a082ff7","cross_cats_sorted":["cs.DM","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-05T02:16:17Z","title_canon_sha256":"a7956d6a3207b27ad7206353f01cab5447015cecd1855a65c49b6a0a81974678"},"schema_version":"1.0","source":{"id":"1109.0787","kind":"arxiv","version":1}},"canonical_sha256":"3453a7f91a80d1ea50b74b20c71a53120a8b44c4804b8c33c6d65c8ff159c661","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3453a7f91a80d1ea50b74b20c71a53120a8b44c4804b8c33c6d65c8ff159c661","first_computed_at":"2026-05-18T04:14:06.651581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:06.651581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T/k/n2Y+nJgldDenkmWhw2ayvs2voBZlqVGtj9aMl1fQI0tv7DAvstY0i5XMWUuHy/IClIfdJZN63W+6oI6NCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:06.652130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.0787","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4879233c45888519e2ebf85b7c2a882067d5ac9518cbb3be870257a257bde02a","sha256:24c96c8ba902805521a2ed20b559e3a987aec8eb495509021adbc0de8e6686be"],"state_sha256":"912e07c091f0ca0858cafcb010018ce05bed0dbaaaae8f1a65bb013c670a1d2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgEIWNg/PcaQRdCmciANPFPWC6SgB1LtVyiDajuZGXoFRNv1yNZzYOmftKhzDnsR3nQxNMFbkCOoiHOG2cSpBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:02:49.514231Z","bundle_sha256":"5b82e04120106595a402dff1876834328e06a78fa37f853386283d917f9dfd20"}}