{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WJOUH2RL4A2UJIVZBVDNHB5UJI","short_pith_number":"pith:WJOUH2RL","schema_version":"1.0","canonical_sha256":"b25d43ea2be03544a2b90d46d387b44a1b0f2d9e5de12bed72b9d360f5f991f5","source":{"kind":"arxiv","id":"1705.01358","version":1},"attestation_state":"computed","paper":{"title":"Construction of Four Completely Independent Spanning Trees on Augmented Cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B. N. Waphare, S. A. Kandekar, S. A. Mane","submitted_at":"2017-05-03T11:07:05Z","abstract_excerpt":"Let T1, T2,..., Tk be spanning trees in a graph G. If for any pair of vertices {u, v} of G, the paths between u and v in every Ti( 0 < i < k+1) do not contain common edges and common vertices, except the vertices u and v, then T1, T2,..., Tk are called completely independent spanning trees in G. The n-dimensional augmented cube, denoted as AQn, a variation of the hypercube possesses several embeddable properties that the hypercube and its variations do not possess. For AQn (n > 5), construction of 4 completely independent spanning trees of which two trees with diameters 2n - 5 and two trees wi"},"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":"1705.01358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-03T11:07:05Z","cross_cats_sorted":[],"title_canon_sha256":"486261cf8bf7ee71514d964a048a7bd9a3b93e884dbbc017a9ecc5fcf1097337","abstract_canon_sha256":"7d273da9836af153d9b27d37c4662234558cba8ee4b21e7b6d1d48215425f07c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:05.337564Z","signature_b64":"GoaIVIAQITpvydVpM3sHNXuI2yodjiW1JTGuLTtvUVWq5cgOwpDuh+P3rpYgUDkuC09OmfkMrF3NnZi/mkVEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b25d43ea2be03544a2b90d46d387b44a1b0f2d9e5de12bed72b9d360f5f991f5","last_reissued_at":"2026-05-18T00:45:05.337169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:05.337169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of Four Completely Independent Spanning Trees on Augmented Cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B. N. Waphare, S. A. Kandekar, S. A. Mane","submitted_at":"2017-05-03T11:07:05Z","abstract_excerpt":"Let T1, T2,..., Tk be spanning trees in a graph G. If for any pair of vertices {u, v} of G, the paths between u and v in every Ti( 0 < i < k+1) do not contain common edges and common vertices, except the vertices u and v, then T1, T2,..., Tk are called completely independent spanning trees in G. The n-dimensional augmented cube, denoted as AQn, a variation of the hypercube possesses several embeddable properties that the hypercube and its variations do not possess. For AQn (n > 5), construction of 4 completely independent spanning trees of which two trees with diameters 2n - 5 and two trees wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01358","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":"1705.01358","created_at":"2026-05-18T00:45:05.337234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01358v1","created_at":"2026-05-18T00:45:05.337234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01358","created_at":"2026-05-18T00:45:05.337234+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJOUH2RL4A2U","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJOUH2RL4A2UJIVZ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJOUH2RL","created_at":"2026-05-18T12:31:53.515858+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/WJOUH2RL4A2UJIVZBVDNHB5UJI","json":"https://pith.science/pith/WJOUH2RL4A2UJIVZBVDNHB5UJI.json","graph_json":"https://pith.science/api/pith-number/WJOUH2RL4A2UJIVZBVDNHB5UJI/graph.json","events_json":"https://pith.science/api/pith-number/WJOUH2RL4A2UJIVZBVDNHB5UJI/events.json","paper":"https://pith.science/paper/WJOUH2RL"},"agent_actions":{"view_html":"https://pith.science/pith/WJOUH2RL4A2UJIVZBVDNHB5UJI","download_json":"https://pith.science/pith/WJOUH2RL4A2UJIVZBVDNHB5UJI.json","view_paper":"https://pith.science/paper/WJOUH2RL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01358&json=true","fetch_graph":"https://pith.science/api/pith-number/WJOUH2RL4A2UJIVZBVDNHB5UJI/graph.json","fetch_events":"https://pith.science/api/pith-number/WJOUH2RL4A2UJIVZBVDNHB5UJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJOUH2RL4A2UJIVZBVDNHB5UJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJOUH2RL4A2UJIVZBVDNHB5UJI/action/storage_attestation","attest_author":"https://pith.science/pith/WJOUH2RL4A2UJIVZBVDNHB5UJI/action/author_attestation","sign_citation":"https://pith.science/pith/WJOUH2RL4A2UJIVZBVDNHB5UJI/action/citation_signature","submit_replication":"https://pith.science/pith/WJOUH2RL4A2UJIVZBVDNHB5UJI/action/replication_record"}},"created_at":"2026-05-18T00:45:05.337234+00:00","updated_at":"2026-05-18T00:45:05.337234+00:00"}