{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PJGZ7TGVYHNTMTKMCKN535S62R","short_pith_number":"pith:PJGZ7TGV","schema_version":"1.0","canonical_sha256":"7a4d9fccd5c1db364d4c129bddf65ed477678bc7e8eab9105b32519ba3fce2f0","source":{"kind":"arxiv","id":"1702.08289","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.08289","created_at":"2026-05-18T00:49:55.359654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08289v1","created_at":"2026-05-18T00:49:55.359654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08289","created_at":"2026-05-18T00:49:55.359654+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJGZ7TGVYHNT","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJGZ7TGVYHNTMTKM","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJGZ7TGV","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R","json":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R.json","graph_json":"https://pith.science/api/pith-number/PJGZ7TGVYHNTMTKMCKN535S62R/graph.json","events_json":"https://pith.science/api/pith-number/PJGZ7TGVYHNTMTKMCKN535S62R/events.json","paper":"https://pith.science/paper/PJGZ7TGV"},"agent_actions":{"view_html":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R","download_json":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R.json","view_paper":"https://pith.science/paper/PJGZ7TGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08289&json=true","fetch_graph":"https://pith.science/api/pith-number/PJGZ7TGVYHNTMTKMCKN535S62R/graph.json","fetch_events":"https://pith.science/api/pith-number/PJGZ7TGVYHNTMTKMCKN535S62R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R/action/storage_attestation","attest_author":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R/action/author_attestation","sign_citation":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R/action/citation_signature","submit_replication":"https://pith.science/pith/PJGZ7TGVYHNTMTKMCKN535S62R/action/replication_record"}},"created_at":"2026-05-18T00:49:55.359654+00:00","updated_at":"2026-05-18T00:49:55.359654+00:00"}