{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PJGZ7TGVYHNTMTKMCKN535S62R","short_pith_number":"pith:PJGZ7TGV","canonical_record":{"source":{"id":"1702.08289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-27T14:03:33Z","cross_cats_sorted":[],"title_canon_sha256":"415dcf4be063f1f06d8c3779595691a759bfb121681a9768097707e9c1e2d8b1","abstract_canon_sha256":"57a051e0852eb84ac8362b86c974bc4efe27d7a79632b83f9ce623c278558c29"},"schema_version":"1.0"},"canonical_sha256":"7a4d9fccd5c1db364d4c129bddf65ed477678bc7e8eab9105b32519ba3fce2f0","source":{"kind":"arxiv","id":"1702.08289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08289","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08289v1","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08289","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"PJGZ7TGVYHNT","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PJGZ7TGVYHNTMTKM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PJGZ7TGV","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PJGZ7TGVYHNTMTKMCKN535S62R","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-27T14:03:33Z","cross_cats_sorted":[],"title_canon_sha256":"415dcf4be063f1f06d8c3779595691a759bfb121681a9768097707e9c1e2d8b1","abstract_canon_sha256":"57a051e0852eb84ac8362b86c974bc4efe27d7a79632b83f9ce623c278558c29"},"schema_version":"1.0"},"canonical_sha256":"7a4d9fccd5c1db364d4c129bddf65ed477678bc7e8eab9105b32519ba3fce2f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:55.360257Z","signature_b64":"cKCyUV7IYP0mKzpyhy47o3IZPL40yxOb+peagPZQKSWu8ZwB9qWmeNmONaSQyUot14zkwrhcucVPfFFR6bCWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a4d9fccd5c1db364d4c129bddf65ed477678bc7e8eab9105b32519ba3fce2f0","last_reissued_at":"2026-05-18T00:49:55.359537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:55.359537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08289","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-18T00:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60SmjDBVwWAW16XeXnAWQPaE/luvBkk8GXPvLs+Px2zPAKSMo3s7nUtPyxMWEaQSW9R6Dhw64B88E0qW8/tGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:11:33.320156Z"},"content_sha256":"0d2d06a268c9111f5151cde0840e2812b49becef74898a8bc843a3836e3734f6","schema_version":"1.0","event_id":"sha256:0d2d06a268c9111f5151cde0840e2812b49becef74898a8bc843a3836e3734f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PJGZ7TGVYHNTMTKMCKN535S62R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Benoit Darties (Le2i), Nicolas Gastineau (LAMSADE), Olivier Togni (Le2i)","submitted_at":"2017-02-27T14:03:33Z","abstract_excerpt":"The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by defining (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges, respectively) that are shared by more than one tree. We illustrate how (i, j)-disjoint spanning trees provide some nuances between the existence of disjoint connected dominating sets and completely independent spanning trees. We prove that determinin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08289","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-18T00:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EUqxRbKLIiFX9QwSSSMwBNyrLYIDjATrz/06FcpiPSce0FJ1SLzreAdaNbGt516DmgCBnlDJI+tRTlzFgJkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:11:33.320525Z"},"content_sha256":"2a5067a682c315e554cb696ffb2d1855b8837be8ee7392fe0869f60c55e9e205","schema_version":"1.0","event_id":"sha256:2a5067a682c315e554cb696ffb2d1855b8837be8ee7392fe0869f60c55e9e205"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R/bundle.json","state_url":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJGZ7TGVYHNTMTKMCKN535S62R/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-22T16:11:33Z","links":{"resolver":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R","bundle":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R/bundle.json","state":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJGZ7TGVYHNTMTKMCKN535S62R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PJGZ7TGVYHNTMTKMCKN535S62R","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":"57a051e0852eb84ac8362b86c974bc4efe27d7a79632b83f9ce623c278558c29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-27T14:03:33Z","title_canon_sha256":"415dcf4be063f1f06d8c3779595691a759bfb121681a9768097707e9c1e2d8b1"},"schema_version":"1.0","source":{"id":"1702.08289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08289","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08289v1","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08289","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"PJGZ7TGVYHNT","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PJGZ7TGVYHNTMTKM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PJGZ7TGV","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:2a5067a682c315e554cb696ffb2d1855b8837be8ee7392fe0869f60c55e9e205","target":"graph","created_at":"2026-05-18T00:49:55Z","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 search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by defining (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges, respectively) that are shared by more than one tree. We illustrate how (i, j)-disjoint spanning trees provide some nuances between the existence of disjoint connected dominating sets and completely independent spanning trees. We prove that determinin","authors_text":"Benoit Darties (Le2i), Nicolas Gastineau (LAMSADE), Olivier Togni (Le2i)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-27T14:03:33Z","title":"Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08289","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:0d2d06a268c9111f5151cde0840e2812b49becef74898a8bc843a3836e3734f6","target":"record","created_at":"2026-05-18T00:49:55Z","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":"57a051e0852eb84ac8362b86c974bc4efe27d7a79632b83f9ce623c278558c29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-27T14:03:33Z","title_canon_sha256":"415dcf4be063f1f06d8c3779595691a759bfb121681a9768097707e9c1e2d8b1"},"schema_version":"1.0","source":{"id":"1702.08289","kind":"arxiv","version":1}},"canonical_sha256":"7a4d9fccd5c1db364d4c129bddf65ed477678bc7e8eab9105b32519ba3fce2f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a4d9fccd5c1db364d4c129bddf65ed477678bc7e8eab9105b32519ba3fce2f0","first_computed_at":"2026-05-18T00:49:55.359537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:55.359537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cKCyUV7IYP0mKzpyhy47o3IZPL40yxOb+peagPZQKSWu8ZwB9qWmeNmONaSQyUot14zkwrhcucVPfFFR6bCWDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:55.360257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d2d06a268c9111f5151cde0840e2812b49becef74898a8bc843a3836e3734f6","sha256:2a5067a682c315e554cb696ffb2d1855b8837be8ee7392fe0869f60c55e9e205"],"state_sha256":"f53876d601c95842b957a2a45843f043c6321dac06ef404c4bb74a043c8db520"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFZbxsfuKArUusuXb7N8d4/efAKuhEotTwhaNetQF9LJr2h9SHpUYzPMfPwUEzA5kJp9IQidr3i3Ry2fSoqNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T16:11:33.322454Z","bundle_sha256":"a6c4ec05d68fda7ff5de39d6fc4476084f714c583bf5db414d2d927d6cd2f291"}}