{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IX4AMC6VDLN5VJ4KKBKM6VBOTX","short_pith_number":"pith:IX4AMC6V","canonical_record":{"source":{"id":"1606.03872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T09:30:48Z","cross_cats_sorted":[],"title_canon_sha256":"d0a5043793f62bd30cd2268a88e76e8e28028b494b16caaf16da2a3495120771","abstract_canon_sha256":"966a8f257a66458785654374a357f54218bbde69b6ab82cb28de47fa12dcb3a6"},"schema_version":"1.0"},"canonical_sha256":"45f8060bd51adbdaa78a5054cf542e9de367f07bc061ceec5eaae29c1012c35a","source":{"kind":"arxiv","id":"1606.03872","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03872","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03872v2","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03872","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"IX4AMC6VDLN5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IX4AMC6VDLN5VJ4K","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IX4AMC6V","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IX4AMC6VDLN5VJ4KKBKM6VBOTX","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T09:30:48Z","cross_cats_sorted":[],"title_canon_sha256":"d0a5043793f62bd30cd2268a88e76e8e28028b494b16caaf16da2a3495120771","abstract_canon_sha256":"966a8f257a66458785654374a357f54218bbde69b6ab82cb28de47fa12dcb3a6"},"schema_version":"1.0"},"canonical_sha256":"45f8060bd51adbdaa78a5054cf542e9de367f07bc061ceec5eaae29c1012c35a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:19.647874Z","signature_b64":"Tq4inmp21zqP2iQ7Mo97APNLe0TzFROxct4L8AIuRZqg9HBRWS6RWdLdBEwq9WmxLsDcbjat8pchmTA4aNowBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45f8060bd51adbdaa78a5054cf542e9de367f07bc061ceec5eaae29c1012c35a","last_reissued_at":"2026-05-18T01:12:19.647523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:19.647523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03872","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-18T01:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fRJF+9OGdSBXwzknjPq+bfDvWo9eN0R1wScp8TkYfHZ+Hbt5mfCAjY4svP0iviWlvtgjIT1Lsmj61GJZgtcgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:07:08.489960Z"},"content_sha256":"18b30dc1e5560769a8d5dd8e3a5a8c3953cf0342dba74437853b0304a1941786","schema_version":"1.0","event_id":"sha256:18b30dc1e5560769a8d5dd8e3a5a8c3953cf0342dba74437853b0304a1941786"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IX4AMC6VDLN5VJ4KKBKM6VBOTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The $(k,\\ell)$-proper index of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Hong Chang, Xueliang Li, Zhongmei Qin","submitted_at":"2016-06-13T09:30:48Z","abstract_excerpt":"A tree $T$ in an edge-colored graph is called a {\\it proper tree} if no two adjacent edges of $T$ receive the same color. Let $G$ be a connected graph of order $n$ and $k$ be an integer with $2\\leq k \\leq n$. For $S\\subseteq V(G)$ and $|S| \\ge 2$, an $S$-tree is a tree containing the vertices of $S$ in $G$. Suppose $\\{T_1,T_2,\\ldots,T_\\ell\\}$ is a set of $S$-trees, they are called \\emph{internally disjoint} if $E(T_i)\\cap E(T_j)=\\emptyset$ and $V(T_i)\\cap V(T_j)=S$ for $1\\leq i\\neq j\\leq \\ell$. For a set $S$ of $k$ vertices of $G$, the maximum number of internally disjoint $S$-trees in $G$ is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03872","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-18T01:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7vJihjaKuZIgHjd8EM0uCHH8KIfsQ8Pttu2rU8BBpE1BQMqve6ayiy66kbP+d0yfIgYlN5bGN0RNUH5Kn9cFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:07:08.490327Z"},"content_sha256":"ec8379dfe62ab32f70431db35774fb2ec18d2135e65f45142664ecd10525dcf7","schema_version":"1.0","event_id":"sha256:ec8379dfe62ab32f70431db35774fb2ec18d2135e65f45142664ecd10525dcf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX/bundle.json","state_url":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX/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-03T22:07:08Z","links":{"resolver":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX","bundle":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX/bundle.json","state":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IX4AMC6VDLN5VJ4KKBKM6VBOTX","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":"966a8f257a66458785654374a357f54218bbde69b6ab82cb28de47fa12dcb3a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T09:30:48Z","title_canon_sha256":"d0a5043793f62bd30cd2268a88e76e8e28028b494b16caaf16da2a3495120771"},"schema_version":"1.0","source":{"id":"1606.03872","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03872","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03872v2","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03872","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"IX4AMC6VDLN5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IX4AMC6VDLN5VJ4K","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IX4AMC6V","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:ec8379dfe62ab32f70431db35774fb2ec18d2135e65f45142664ecd10525dcf7","target":"graph","created_at":"2026-05-18T01:12:19Z","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":"A tree $T$ in an edge-colored graph is called a {\\it proper tree} if no two adjacent edges of $T$ receive the same color. Let $G$ be a connected graph of order $n$ and $k$ be an integer with $2\\leq k \\leq n$. For $S\\subseteq V(G)$ and $|S| \\ge 2$, an $S$-tree is a tree containing the vertices of $S$ in $G$. Suppose $\\{T_1,T_2,\\ldots,T_\\ell\\}$ is a set of $S$-trees, they are called \\emph{internally disjoint} if $E(T_i)\\cap E(T_j)=\\emptyset$ and $V(T_i)\\cap V(T_j)=S$ for $1\\leq i\\neq j\\leq \\ell$. For a set $S$ of $k$ vertices of $G$, the maximum number of internally disjoint $S$-trees in $G$ is ","authors_text":"Colton Magnant, Hong Chang, Xueliang Li, Zhongmei Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T09:30:48Z","title":"The $(k,\\ell)$-proper index of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03872","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:18b30dc1e5560769a8d5dd8e3a5a8c3953cf0342dba74437853b0304a1941786","target":"record","created_at":"2026-05-18T01:12:19Z","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":"966a8f257a66458785654374a357f54218bbde69b6ab82cb28de47fa12dcb3a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T09:30:48Z","title_canon_sha256":"d0a5043793f62bd30cd2268a88e76e8e28028b494b16caaf16da2a3495120771"},"schema_version":"1.0","source":{"id":"1606.03872","kind":"arxiv","version":2}},"canonical_sha256":"45f8060bd51adbdaa78a5054cf542e9de367f07bc061ceec5eaae29c1012c35a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45f8060bd51adbdaa78a5054cf542e9de367f07bc061ceec5eaae29c1012c35a","first_computed_at":"2026-05-18T01:12:19.647523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:19.647523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tq4inmp21zqP2iQ7Mo97APNLe0TzFROxct4L8AIuRZqg9HBRWS6RWdLdBEwq9WmxLsDcbjat8pchmTA4aNowBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:19.647874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03872","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18b30dc1e5560769a8d5dd8e3a5a8c3953cf0342dba74437853b0304a1941786","sha256:ec8379dfe62ab32f70431db35774fb2ec18d2135e65f45142664ecd10525dcf7"],"state_sha256":"fb64e971d77a15011b0f9c79727b59579a95453704812b7b9b4a067a8d40e5f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XHDHCtFA/bQck/b2ppC51E6cEWmOHmgcoN1UVGR9aQZWNN/65GlLdK9GAg3Rxf2eblYFp8hNC6nT4tNokx6UCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:07:08.492293Z","bundle_sha256":"85520224c780fd0b8f449fc09043a5f5b88d7a0056784dda74f456703ffafd9c"}}